Journal of Combinatorial Theory, Series B, Volume 78

Volume 78, Number 1, January 2000

• Genghua Fan, Cun-Quan Zhang:
  Circuit Decompositions of Eulerian Graphs. 1-23
  
• Qiongxiang Huang, Jixiang Meng:
  A Classification of DCI(CI)-Subsets for Cyclic Group of Odd Prime Power Order. 24-34
  
• Feng Ming Dong:
  Proof of a Chromatic Polynomial Conjecture. 35-44
  
• Mark N. Ellingham, Xiaoya Zha:
  The Spectral Radius of Graphs on Surfaces. 45-56
  
• Hal A. Kierstead:
  A Simple Competitive Graph Coloring Algorithm. 57-68
  
• Matthias Kriesell:
  The k-Critical 2k-Connected Graphs for kepsilon{3, 4}. 69-80
  
• Bruce A. Reed, Robin Thomas:
  Clique Minors in Graphs and Their Complements. 81-85
  
• Itai Benjamini, Olle Häggström, Elchanan Mossel:
  On Random Graph Homomorphisms into Z. 86-114
  
• Gábor N. Sárközy, Stanley M. Selkow:
  Vertex Partitions by Connected Monochromatic k-Regular Graphs. 115-122
  
• Raphael Yuster:
  Packing and Decomposition of Graphs with Trees. 123-140
  
• Graham Brightwell, Peter Winkler:
  Gibbs Measures and Dismantlable Graphs. 141-166
  

Volume 78, Number 2, March 2000

• C. Paul Bonnington, Mike J. Grannell, Terry S. Griggs, Jozef Sirán:
  Exponential Families of Non-Isomorphic Triangulations of Complete Graphs. 169-184
  
• Hagai Ilani, Michael Lomonosov:
  Maximum Balanced Flow in a Network. 185-197
  
• Glenn Tesler:
  Matchings in Graphs on Non-orientable Surfaces. 198-231
  
• Gregory Gutin, Anders Yeo:
  Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian. 232-242
  
• Frédéric Havet, Stéphan Thomassé:
  Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. 243-273
  
• Dominique de Caen, Zoltán Füredi:
  The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane. 274-276
  
• Martin Kochol:
  Equivalence of Fleischner's and Thomassen's Conjectures. 277-279