Journal: Combinatorica

Volume 4, Issue 4

259 -- 264Miklós Ajtai, János Komlós, Gábor E. Tusnády. On optimal matchings
265 -- 273Mark N. Ellingham, Derek A. Holton, Charles H. C. Little. Cycles through ten vertices in 3-connected cubic graphs
275 -- 279Hikoe Enomoto, Akira Saito. Disjoint shortest paths in graphs
281 -- 290Heinz Gröflin. Path-closed sets
291 -- 295Martin Grötschel, László Lovász, Alexander Schrijver. Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
297 -- 306Jeff Kahn, Michael E. Saks, Dean Sturtevant. A topological approach to evasiveness
307 -- 316Alexandr V. Kostochka. Lower bound of the Hadwiger number of graphs by their average degree
317 -- 319Igor Kríz. A class of dimension-skipping graphs
321 -- 323Jacobus H. van Lint. On equidistant binary codes length n = 4k+1 with distance d = 2k
325 -- 338Brendan D. McKay, Nicholas C. Wormald. Automorphisms of random graphs with specified vertices
339 -- 344Michael von Rimscha. The reconstruction problem for certain infinite graphs
345 -- 349Vojtech Rödl. On combinatorial properties of spheres in eulidean spaces
351 -- 356Norbert Seifter. On automorphisms of infinite graphs with forbidden subgraphs
357 -- 362Douglas R. Stinson, G. H. John van Rees. The equivalence of certain equidistant binary codes and symmetric BIBDs
363 -- 372László A. Székely. On the number of homogeneous subgraphs of a graph
373 -- 396Narendra Karmarkar. A new polynomial-time algorithm for linear programming

Volume 4, Issue 2

121 -- 130Jeremy E. Dawson, Jennifer Seberry, David B. Skillicorn. The directed packing numbers DD (t, v, v), t>=;4
131 -- 131György Elekes. n points in the plane can determine n :::3/2::: unit circles
133 -- 140Konrad Engel. An Erdös - Ko- Rado theorem for the subcubes of a cube
141 -- 148Peter Frankl, Vojtech Rödl. Families of finite sets with three intersections
149 -- 159Peter Frankl. Hypergraphs do not jump
161 -- 168Zoltán Füredi. Hypergraphs in which all disjoint pairs have distinct unions
169 -- 179Frank Harary, Robert W. Robinson. Isomorphic factorizations VIII: Bisectable trees
181 -- 182Jeff Kahn, Michael E. Saks. A polyomino with no stochastic function
183 -- 185Henry A. Kierstead, Endre Szemerédi, William T. Trotter. On coloring graphs with locally small chromatic number
187 -- 195James G. Oxley. On the intersections of circuits and cocircuits in matroids
197 -- 206K. R. Parthasarathy, N. Srinivasan. Geodetic blocks of diameter three
207 -- 212S. C. Shee, H. H. Teh. H-extensions of graphs
213 -- 218László A. Székely. Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space
219 -- 239Bernd Voigt. Canonization theorems for finite affine and linear spaces
241 -- 245Alfred Weiss. Girth of bipartite sextet graphs
247 -- 257Richard M. Wilson. The exact bound in the Erdös - Ko - Rado theorem

Volume 4, Issue 1

1 -- 7Ron Aharoni. On an obstruction for perfect matching
7 -- 19Béla Bollobás, Victor Klee. Diameters of random bipartite graphs
21 -- 34Péter L. Erdös, Peter Frankl, Gyula O. H. Katona. Intersecting Sperner families and their convex hulls
35 -- 38Siemion Fajtlowicz. Independence, clique size and maximum degree
39 -- 45Peter Frankl, János Pach. On disjointly representable sets
47 -- 52András Hajnal, Péter Komjáth. What must and what need not be contained in a graph of uncountable chromatic number?
53 -- 59Wilfried Imrich. Explicit construction of regular graphs without small cycles
61 -- 70Amram Meir, John W. Moon. On random mapping patterns
71 -- 78Jaroslav Nesetril, Vojtech Rödl. Sparse Ramsey graphs
79 -- 88Kevin T. Phelps, Vojtech Rödl. On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
89 -- 99Horst Sachs. Perfect matchings in hexagonal systems
101 -- 110Miklós Simonovits, Vera T. Sós. On restricted colourings of K::n::
111 -- 116Zsolt Tuza. Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
117 -- 119Douglas B. West, William T. Trotter, G. W. Peck, Peter W. Shor. Regressions and monotone chains: a ramsey - type extermal problem for partial orders