External Links

    Journal: Combinatorica

    Volume 2, Issue 4

    333 -- 340Andries E. Brouwer. The uniqueness of the near hexagon on 729 points
    341 -- 345Michel Deza, Peter Frankl. On the vector space of 0-configurations
    347 -- 359Trevor I. Fenner, Alan M. Frieze. On the connectivity of random m-orientable graphs and digraphs
    361 -- 371András Frank. Disjoint paths in a rectilinear grid
    373 -- 376Robert L. Hemminger, Heinz Adolf Jung, Alexander K. Kelmans. On 3-skein isomorphisms of graphs
    377 -- 383Vojtech Rödl. Nearly bipartite graphs with large chromatic number
    385 -- 393Laurence A. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem
    395 -- 398Leszek S. Zaremba, S. Perz. On a geometric property of perfect graphs

    Volume 2, Issue 3

    203 -- 205László Lovász. Tibor Gallai
    207 -- 212Paul Erdös. Personal reminiscences and remarks on the mathematical work of Tibor Gallai
    213 -- 222Claude Berge. Diperfect graphs
    223 -- 228Béla Bollobás. Long paths in sparse random graphs
    229 -- 235François Bry, Michel Las Vergnas. The Edmonds - Gallai decomposition for matchings in locally finite graphs
    237 -- 246Ludwig Danzer, Branko Grünbaum. Intersection properties of boxes in R:::d:::
    247 -- 274J. Edmonds, László Lovász, William R. Pulleyblank. Brick decompositions and the matching rank of graphs
    275 -- 288Paul Erdös, Miklós Simonovits. Compactness results in extremal graph theory
    289 -- 295Paul Erdös, Vera T. Sós. On Ramsey - Turán type theorems for hypergraphs
    297 -- 304Rudolf Halin. Some remarks on interval graphs
    305 -- 309Jenö Lehel. Covers in hypergraphs
    311 -- 314Richard Rado. Atoms of families of sets
    315 -- 323Michael Stiebitz. Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
    325 -- 332W. T. Tutte. The method of alternating paths

    Volume 2, Issue 2

    103 -- 109R. D. Baker. Symmetric designs with Bruck subdesigns
    111 -- 123József Beck. Irregularities of two-colourings of the NxN square lattice
    125 -- 134Béla Bollobás, Wenceslas Fernandez de la Vega. The diameter of random regular graphs
    135 -- 141Raul Cordovil. On Reid s 3-simplicial matroid theorem
    143 -- 147Yahya Ould Hamidoune. A note on the girth of digraphs
    149 -- 152Derek A. Holton, Charles H. C. Little. Regular odd rings and non-planar graphs
    153 -- 155Ferenc Juhász. The asymptotic behaviour of Lovász theta-function for random graphs
    157 -- 176R. Kemp. On the average oscillation of a stack
    177 -- 186Peter Kirschenhofer, Helmut Prodinger. On the average hyperoscillations of planted plane trees
    187 -- 192Alexandr V. Kostochka. A class of constructions for Turán s (3, 4) problem
    193 -- 201Vladimír Müller, Vojtech Rödl. Monotone paths in ordered graphs

    Volume 2, Issue 1

    1 -- 7Miklós Ajtai, János Komlós, Endre Szemerédi. Largest random component of a k-cube
    9 -- 13Peter J. Cameron. There are only finitely many finite distance-transitive graphs of given valency greater than two
    15 -- 23M. J. Dunwoody. Cutting up graphs
    25 -- 36Hans-Dietrich O. F. Gronau. On Sperner families in which no k sets have an empty intersection III
    37 -- 51Anthony J. W. Hilton. Canonical edge-colourings of locally finite graphs
    53 -- 62Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen. A nine point theorem for 3-connected graphs
    63 -- 69H. D. Macpherson. Infinite distance transitive graphs of finite valency
    71 -- 78G. A. Margulis. Explicit constructions of graphs without short cycles and low density codes
    79 -- 90Richard J. Nowakowski, Ivan Rival. On a class of isometric subgraphs of a graph
    91 -- 97Paul D. Seymour. Packing nearly-disjoint sets
    99 -- 101W. D. Wallis. Asymptotic values of clique partition numbers
    runs on