Journal: Combinatorica

Volume 12, Issue 4

373 -- 374Paul Erdös. In memory of Tibor Gallai
375 -- 380Noga Alon, Colin McDiarmid, Bruce A. Reed. Star arboricity
381 -- 388Vladimir G. Boltyanski, P. S. Soltan. A solution of Hadwiger s covering problem for zonoids
389 -- 410Jin-yi Cai, Martin Fürer, Neil Immerman. An optimal lower bound on the number of variables for graph identifications
411 -- 416Ehud Hrushovski. Extending partial isomorphisms of graphs
417 -- 423Jeff Kahn. On a problem of Erdös and Lovász: random lines in a projective plane
425 -- 432Siu Lun Ma. Reversible relative difference sets
433 -- 447Ernst W. Mayr, C. Greg Plaxton. On the spanning trees of weighted graphs
449 -- 461Noam Nisan. Pseudorandom generators for space-bounded computation
463 -- 473Hans Jürgen Prömel, Angelika Steger. The asymptotic number of graphs not containing a fixed color-critical subgraph
475 -- 480Thomas Stehling. On computing the number of subgroups of a finite Abelian group
481 -- 492Carsten Thomassen. The Hadwiger number of subgroups vertex-transitive graphs
493 -- 496Peter Frankl. The convex hull of antichains in posets

Volume 12, Issue 3

247 -- 260Ron M. Adin. Counting colorful multi-dimensional trees
261 -- 274Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir. The number of edges of many faces in a line segment arrangement
275 -- 285Patrick Chiu. Cubic Ramanujan graphs
287 -- 293Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely. Sharpening the LYM inequality
295 -- 301Péter Hajnal, Mario Szegedy. On packing bipartite graphs
303 -- 316Ron Holzman, Daniel J. Kleitman. Sign vectors and unit vectors
317 -- 321Thomas Dale Porter. On a bottleneck bipartition conjecture of Erdös
331 -- 350Wansoo T. Rhee, Michel Talagrand. Packing random items of three colors
351 -- 361Attila Sali. Some intersection theorems
363 -- 365Amha Tume Lisan. Multi-dimensional Ramsey theorems - an example
367 -- 369Dezsö Miklós. Disproof of a conjecture in graph reconstruction theory

Volume 12, Issue 2

125 -- 134Noga Alon, Michael Tarsi. Colorings and orientations of graphs
135 -- 142Imre Bárány, Roger Howe, László Lovász. On integer points in polyhedra: a lower bound
143 -- 147Aart Blokhuis, Ákos Seress, Henny A. Wilbrink. Characterization of complete exterior sets of conics
149 -- 153David M. Jackson, L. Bruce Richmond. The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line
155 -- 160Jeff Kahn, Paul D. Seymour. A fractional version of the Erdös-Faber-Lovász conjecture
161 -- 177Ravi Kannan. Lattice translates of a polytope and the Frobenius problem
179 -- 192János Körner, Gábor Simonyi, Zsolt Tuza. Perfect couples of graphs
193 -- 201Kevin McAvaney, Jack M. Robertson, William A. Webb. Ramsey partitions of integers and fair divisions
203 -- 220Peter McMullen, E. Schulte. Regular polytopes of type {4, 4, 3} and {4, 4, 4}
221 -- 226Pavel Pudlák, Vojtech Rödl. A combinatorial approach to complexity
227 -- 235Tamás Szonyi. Note on the existence of large minimal blocking sets in Galois planes
237 -- 240Takayuki Hibi. Dual polytopes of rational convex polytopes
241 -- 246Gyula Y. Katona. Searching for f-Hamiltonian circuits

Volume 12, Issue 1

1 -- 17Rudolf Ahlswede, Ning Cai, Zhen Zhang. Diametric theorems in seuence spaces
19 -- 26Vasek Chvátal, Colin McDiarmid. Small transversals in hypergraphs
27 -- 37William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid. On integer points in polyhedra
39 -- 44Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor. Bounds for arrays of dots with distinct slopes or lengths
45 -- 51Alexander K. Kelmans. Spanning trees of extended graphs
53 -- 76Gary L. Miller, Vijaya Ramachandran. A new graph triconnectivity algorithm and its parallelization
77 -- 87Tomaz Pisanski, Thomas W. Tucker, Dave Witte. The non-orientable genus of some metacyclic groups
89 -- 93Alexander Pott. New necessary conditions on the existence of abelian difference sets
95 -- 124Rajamani Sundar. On the Deque conjecture for the splay algorithm