Journal: Combinatorica

Volume 5, Issue 4

271 -- 282R. W. Decker, H. H. Glover, L. P. Huneke. Computing the genus of the 2-amalgamations of graphs
283 -- 293Reinhard Diestel, Rudolf Halin, Walter Vogler. Some remarks on universal graphs
295 -- 300Mohamed M. El-Zahar, Paul Erdös. On the existence of two non-neighboring subgraphs in a graph
301 -- 309Konrad Engel, Nikolai N. Kuzjurin. About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets
311 -- 318Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp. Multipartite graph - space graph Ramsey numbers
319 -- 323Jeff Kahn. A problem of P. Seymour on nonbinary matroids
325 -- 336Alexander V. Karzanov. Families of cuts with the MFMC-property
337 -- 342H. J. Landau, B. F. Logan, Larry A. Shepp. An inequality conjectured by Hajela and Seymour arising in combinatorial geometry
343 -- 345James G. Oxley. Proof of a conjecture of Kahn for non-binary matroids
347 -- 349László Pyber. Regular subgraphs of dense graphs
351 -- 358S. S. Shrikhande, N. M. Singhi. On a problem of Erdös and Larson
359 -- 365K. Steffens. Maximal tight sets and the Edmonds - Gallai decomposition for matchings
367 -- 378Robert Endre Tarjan. Sequential access in play trees takes linear time

Volume 5, Issue 3

181 -- 184Ron Aharoni. Fractional matchings and covers in infinite hypergraphs
185 -- 192William H. Cunningham. On submodular function minimization
193 -- 204András Gyárfás, Jenö Lehel, Zsolt Tuza. How many atoms can be defined by boxes
205 -- 214D. J. Hajela, Paul D. Seymour. Counting points in hypercubes and convolution measure algebras
227 -- 228G. Koester. Note to a problem of T. Gallai and G. A. Dirac
229 -- 236Alexandr V. Kostochka. Maximum set of edges no two covered by a clique
237 -- 239Bernt Lindström. A Desagruesian theorem for algebraic combinatorial geometries
241 -- 245James B. Shearer. On a problem of spencer
247 -- 256Éva Tardos. A strongly polynomial minimum cost circulation algorithm
257 -- 260Andrew Vince, Michelle L. Wachs. A shellable poset that is not lexicographically shellable
261 -- 269Heinz-Jürgen Voss. Independent sets in k-chromatic graphs

Volume 5, Issue 2

95 -- 107Jürgen Bierbrauer, Albrecht Brandis. On generalized Ramsey numbers for trees
109 -- 120Knut Deimer. A new upper bound for the length of snakes
121 -- 126Mohamed M. El-Zahar, Norbert Sauer. The chromatic number of the product of two 4-chromatic graphs is 4
127 -- 135Hubert de Fraysseix, Pierre Rosenstiehl. A characterization of planar graphs by Trémaux orders
137 -- 139András Hajnal. The chromatic number of the product of two Alef ::i:: - Chromatic Graphs can be countable
141 -- 147Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra. The struction of a graph: Application to CN-free graphs
149 -- 159Stephen C. Locke. A generalization of Dirac s theorem
161 -- 165Wolfgang Mader. Degree and local connectivity in digraphs
167 -- 179B. L. Rothschild, Ernst G. Straus. On triangulations of the convex hull of n points

Volume 5, Issue 1

1 -- 9Jeremy E. Dawson. Decomposition of binary matroids
11 -- 26Péter L. Erdös, Peter Frankl, Gyula O. H. Katona. Extremal hypergraph problems and convex hulls
27 -- 31Zoltán Füredi. Set-systems with three intersections
33 -- 39C. D. Godsil. Inverses of trees
41 -- 52András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt. On the sum of the reciprocals of cycle lengths in sparse graphs
53 -- 55Ervin Györi. Covering simply connected regions by rectangles
57 -- 65János Komlós. Linear verification for spanning trees
67 -- 79László Pyber. An Erdös - Gallai conjecture
81 -- 94Jeanette P. Schmidt, Eli Shamir. Component structure in the evolution of random hypergraphs