Journal of Combinatorial Theory, Series B, Volume 82

Volume 82, Number 1, May 2001

• Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó:
  Anti-Ramsey Colorings in Several Rounds. 1-18
  Electronic Edition (link) BibTeX
• Norman Biggs:
  A Matrix Method for Chromatic Polynomials. 19-29
  Electronic Edition (link) BibTeX
• Keith Edwards, Graham Farr:
  Fragmentability of Graphs. 30-37
  Electronic Edition (link) BibTeX
• Hong-Jian Lai, Lubomír Soltés:
  Line Graphs and Forbidden Induced Subgraphs. 38-55
  Electronic Edition (link) BibTeX
• Willem H. Haemers:
  Bicliques and Eigenvalues. 56-66
  Electronic Edition (link) BibTeX
• Zhiquan Hu, Feng Tian, Bing Wei:
  Long Cycles through a Linear Forest. 67-80
  Electronic Edition (link) BibTeX
• Matthias Kriesell:
  A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph. 81-101
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  Face Covers and the Genus Problem for Apex Graphs. 102-117
  Electronic Edition (link) BibTeX
• Han Ren, Yanpei Liu:
  4-Regular Maps on the Klein Bottle. 118-137
  Electronic Edition (link) BibTeX
• Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas:
  Directed Tree-Width. 138-154
  Electronic Edition (link) BibTeX
• Ian M. Wanless, Nicholas C. Wormald:
  Regular Graphs with No Homomorphisms onto Cycles. 155-160
  Electronic Edition (link) BibTeX
• Hector A. Juarez, Gelasio Salazar:
  Drawings of C_m?C_n with One Disjoint Family II. 161-165
  Electronic Edition (link) BibTeX

Volume 82, Number 2, July 2001

• Sorin Dragomir, Elisabetta Barletta:
  A New Upper Bound on the Cheeger Number of a Graph. 167-174
  Electronic Edition (link) BibTeX
• Ilse Fischer, Charles H. C. Little:
  A Characterisation of Pfaffian Near Bipartite Graphs. 175-222
  Electronic Edition (link) BibTeX
• László Lovász:
  Steinitz Representations of Polyhedra and the Colin de Verdie`re Number. 223-236
  Electronic Edition (link) BibTeX
• Boris Pittel:
  On the Largest Component of the Random Graph at a Nearcritical Stage. 237-269
  Electronic Edition (link) BibTeX
• Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster:
  Covering Non-uniform Hypergraphs. 270-284
  Electronic Edition (link) BibTeX
• Peter Che Bor Lam, Wai Chee Shiu, Baogang Xu:
  On Structure of Some Plane Graphs with Application to Choosability. 285-296
  Electronic Edition (link) BibTeX
• Odile Favaron, Pierre Fraisse:
  Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs. 297-305
  Electronic Edition (link) BibTeX
• Matthias Kriesell:
  All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. 306-315
  Electronic Edition (link) BibTeX
• Saeed Akbari, Seyed Vahab Mirrokni, Sayyed Bashir Sadjad:
  K_r-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges. 316-318
  Electronic Edition (link) BibTeX
• Alexander Schrijver:
  A Short Proof of Mader's sigma-Paths Theorem. 319-321
  Electronic Edition (link) BibTeX
• Tristan Denley, Haidong Wu:
  A Generalization of a Theorem of Dirac. 322-326
  Electronic Edition (link) BibTeX