External Links

    Journal: Combinatorica

    Volume 6, Issue 4

    287 -- 298Thomas Andreae. On well-quasi-ordering finite graphs by immersion
    299 -- 308Achim Bachem, Walter Kern. Adjoints of oriented matroids
    309 -- 314D. de Caen, Paul Erdös, N. J. Pullmann, Nicholas C. Wormald. Extremal clique coverings of complementary graphs
    315 -- 320Collette R. Coullard. Counterexamples to conjectures on 4-connected matroids
    321 -- 325Stephen Downes. A completion problem for finite affine planes
    327 -- 333Ralph J. Faudree, Richard H. Schelp, Vera T. Sós. Some intersection theorems on two valued functions
    335 -- 354Peter Frankl, Zoltán Füredi. Finite projective spaces and intersecting hypergraphs
    355 -- 363Zoltán Füredi, Jerrold R. Griggs. Families of finite sets with minimum shadows
    365 -- 379A. M. H. Gerards, Alexander Schrijver. Matrices with the Edmonds - Johnson property
    381 -- 385Wen-Lian Hsu. Coloring planar perfect graphs by decomposition
    387 -- 391Howard J. Karloff. A Las Vegas RNC algorithm for maximum matching
    393 -- 398László Pyber. Clique covering of graphs

    Volume 6, Issue 3

    201 -- 206Noga Alon. Covering graphs by the minimum number of equivalence relations
    207 -- 219Noga Alon. Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
    221 -- 233Imre Bárány, Jack Edmonds, Laurence A. Wolsey. Packing and covering a tree by subtrees
    235 -- 343Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel. A non-analytic proof of the Newman - Znám result for disjoint covering systems
    245 -- 260R. Bodendiek, Klaus W. Wagner. A characterization of the minimalbasis of the torus
    261 -- 268Endre Boros, Tamás Szonyi. On the sharpness of a theorem of B. Segre
    269 -- 274Yoshimi Egawa, Hikoe Enomoto, Akira Saito. Contracible edges in triangle-free graphs
    275 -- 278Michele Elia. On the non-existence of Barker sequences
    279 -- 286Peter Frankl. Orthogonal vectors in the n-dimensional cube and codes with missing distances

    Volume 6, Issue 2

    83 -- 96Noga Alon. Eigenvalues and expanders
    97 -- 108Manuel Blum. Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain
    109 -- 122Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
    123 -- 150Harold N. Gabow, Matthias F. M. Stallmann. An augmenting path algorithm for linear matroid parity
    151 -- 178Sergiu Hart, Micha Sharir. Nonlinearity of Davenport - Schinzel sequences and of generalized path compression schemes
    179 -- 200Peter W. Shor. the average-case analysis of some on-line algorithms for bin packing

    Volume 6, Issue 1

    1 -- 13László Babai. On Lovász lattice reduction and the nearest lattice point problem
    15 -- 22Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald. The asymptotic number of acyclic diagraphs I
    23 -- 27Mostafa Blidia. A parity diagraph has a kernel
    29 -- 33Ulrich Faigle, Bill Sands. A size-width inequality for distributive lattices
    35 -- 48Richard M. Karp, Eli Upfal, Avi Wigderson. Constructing a perfect matching is in random NC
    49 -- 54Nathan Linial. Legal coloring of graphs
    55 -- 66Joel Spencer. Balancing vectors in the max norm
    67 -- 71Mario Szegedy. The solution of Graham s greatest common divisor problem
    73 -- 79Ioan Tomescu. On the number of paths and cycles for almost all graphs and digraphs
    runs on