Journal of Combinatorial Theory, Series B, Volume 80

Volume 80, Number 1, September 2000

• Frédéric Havet:
  Oriented Hamiltonian Cycles in Tournaments. 1-31
  Electronic Edition (link) BibTeX
• Matthias Kriesell:
  Contractible Subgraphs in 3-Connected Graphs. 32-48
  Electronic Edition (link) BibTeX
• Jeong Han Kim, Boris Pittel:
  On Tail Distribution of Interpost Distance. 49-56
  Electronic Edition (link) BibTeX
• James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle:
  On the Excluded Minors for Quaternary Matroids. 57-68
  Electronic Edition (link) BibTeX
• Ya-Chen Chen:
  Kneser Graphs Are Hamiltonian For nge3k. 69-79
  Electronic Edition (link) BibTeX
• Jaroslav Nesetril, Claude Tardif:
  Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). 80-97
  Electronic Edition (link) BibTeX
• Nancy Eaton:
  A Near Packing of Two Graphs. 98-103
  Electronic Edition (link) BibTeX
• Sergei K. Lando:
  On a Hopf Algebra in Graph Theory. 104-121
  Electronic Edition (link) BibTeX
• Andrew M. Robertshaw, Douglas R. Woodall:
  Triangles and Neighbourhoods of Independent Sets in Graphs. 122-129
  Electronic Edition (link) BibTeX
• David D. Gebhard, Bruce E. Sagan:
  Sinks in Acyclic Orientations of Graphs. 130-146
  Electronic Edition (link) BibTeX
• Jaroslav Nesetril, André Raspaud:
  Colored Homomorphisms of Colored Mixed Graphs. 147-155
  Electronic Edition (link) BibTeX
• Atsushi Kaneko, Katsuhiro Ota:
  On Minimally (n, )-Connected Graphs. 156-171
  Electronic Edition (link) BibTeX
• Duncan C. Richer:
  Unordered Canonical Ramsey Numbers. 172-177
  Electronic Edition (link) BibTeX

Volume 80, Number 2, November 2000

• John Maharry:
  A Characterization of Graphs with No Cube Minor. 179-201
  Electronic Edition (link) BibTeX
• Alexander A. Ageev, Alexandr V. Kostochka:
  Vertex Set Partitions Preserving Conservativeness. 202-217
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Chromatic Roots and Hamiltonian Paths. 218-224
  Electronic Edition (link) BibTeX
• János Pach, Géza Tóth:
  Which Crossing Number Is It Anyway? 225-246
  Electronic Edition (link) BibTeX
• Hirobumi Mizuno, Iwao Sato:
  Zeta Functions of Graph Coverings. 247-257
  Electronic Edition (link) BibTeX
• Gregory L. Cherlin, Brenda J. Latka:
  Minimal Antichains in Well-founded Quasi-orders with an Application to Tournaments. 258-276
  Electronic Edition (link) BibTeX
• J. D. Skinner II, C. A. B. Smith, W. T. Tutte:
  On the Dissection of Rectangles into Right-Angled Isosceles Triangles. 277-319
  Electronic Edition (link) BibTeX
• Béla Bollobás, Luke Pebody, Oliver Riordan:
  Contraction-Deletion Invariants for Graphs. 320-345
  Electronic Edition (link) BibTeX
• Alexander Schrijver:
  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. 346-355
  Electronic Edition (link) BibTeX
• Yuanqiu Huang, Yanpei Liu:
  Face Size and the Maximum Genus of a Graph 1. Simple Graphs. 356-370
  Electronic Edition (link) BibTeX