External Links

    Journal: Combinatorica

    Volume 11, Issue 4

    299 -- 314Béla Bollobás, Imre Leader. Edge-isoperimetric inequalities in the grid
    315 -- 329André Bouchet. An efficient algorithm to recognize locally equivalent graphs
    331 -- 362Joel Friedman. On the second eigenvalue and random walks n random d-regular graphs
    363 -- 368Jeff Kahn, Nathan Linial. Balancing extensions via Brunn-Minkowski
    369 -- 382Brendan D. McKay, Nicholas C. Wormald. Asymptotic enumeration by degree sequence of graphs with degress o(n:::1/2:::)
    383 -- 387Michael E. Saks, Michael Werman. On computing majority by comparisons
    389 -- 392Yoshimi Egawa, Akira Saito. Contractible edges in non-separating cycles
    393 -- 395Carsten Thomassen. Highly connected non-2-linked digraphs

    Volume 11, Issue 3

    185 -- 189H. L. Abbott, Bing Zhou. The edge density of 4-critical planar graphs
    191 -- 205J. A. Bondy, Genghua Fan. Cycles in weighted graphs
    207 -- 218Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler. The number of t-wise balance designs
    219 -- 230William H. Cunningham, Jan Green-Krótki. b-matching degree-sequence polyhedra
    231 -- 243Ervin Györi. On the number of edge disjoint cliques in graphs of given size
    245 -- 251Yoshiharu Kohayakawa. A note on induced cycles in Kneser graphs
    253 -- 260Hans Jürgen Prömel, Bernd Voigt. Graham-Rothschild parameter words and measurable partitions
    261 -- 273Paul D. Seymour. Directed circuits on a torus
    275 -- 293Bernd Sturmfels, Neil White. Computing combinatorial decompositions of rings
    295 -- 297Tomasz Luczak. A note on the sharp concentration of the chromatic number of random graphs

    Volume 11, Issue 2

    81 -- 96Robert E. L. Aldred, Derek A. Holton, Bill Jackson. Uniform cyclic edge connectivity in cubic graphs
    97 -- 122Noga Alon, Yossi Azar. Parallel comparison algorithms for approximation problems
    123 -- 130Roland Häggkvist, Andrew Thomason. Trees in tournaments
    131 -- 143Péter Hajnal. An Omega(n:::4/3:::) lower bound on the randomized complexity of graph properties
    145 -- 155Nora Hartsfield, Gerhard Ringel. Clean triangulations
    157 -- 171Bala Kalyanasundaram, Georg Schnitger. On the power of white pebbles
    173 -- 179Xiaoyun Lu. On claws belonging to every tournament
    181 -- 184András Gyárfás, Jenö Lehel. Effective on-line coloring of P::5::-free graphs

    Volume 11, Issue 1

    1 -- 8K. T. Arasu, James A. Davis, Dieter Jungnickel, Alexander Pott. Some nonexistence results on divisible difference sets
    9 -- 15Endre Boros, Dieter Jungnickel, Scott A. Vanstone. The existence of non-trivial hyperfactorization of K::2n::
    17 -- 22Jeff Kahn, Roy Meshulam. On mod p transversals
    23 -- 32Valerie King. An Omega(n:::5/4:::) lower bound on the randomized complexity of graph properties
    33 -- 43Donald E. Knuth. Efficient representation of perm groups
    45 -- 54Tomasz Luczak. The chromatic number of random graphs
    55 -- 61Victor Neumann-Lara, Eduardo Rivera-Campo. Spanning trees with bounded degrees
    63 -- 70Noam Nisan. Pseudorandom bits for constant depth circuits
    71 -- 74Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto. A mixed version of Menger s theorem
    75 -- 79Zoltán Füredi. On a Turán type problem of Erdös
    runs on