Journal of Combinatorial Theory, Series B, Volume 83

Volume 83, Number 1, September 2001

• Anna Galluccio, Luis A. Goddyn, Pavol Hell:
  High-Girth Graphs Avoiding a Minor are Nearly Bipartite. 1-14
  Electronic Edition (link) BibTeX
• James F. Geelen, Geoffrey P. Whittle:
  Matroid 4-Connectivity: A Deletion-Contraction Theorem. 15-37
  Electronic Edition (link) BibTeX
• Bojan Mohar, Neil Robertson:
  Flexibility of Polyhedral Embeddings of Graphs in Surfaces. 38-57
  Electronic Edition (link) BibTeX
• Stefanie Gerke, Colin McDiarmid:
  Graph Imperfection. 58-78
  Electronic Edition (link) BibTeX
• Stefanie Gerke, Colin McDiarmid:
  Graph Imperfection II. 79-101
  Electronic Edition (link) BibTeX
• Daniel P. Sanders, Yue Zhao:
  A New Bound on the Cyclic Chromatic Number. 102-111
  Electronic Edition (link) BibTeX
• Bertrand Guenin:
  A Characterization of Weakly Bipartite Graphs. 112-168
  Electronic Edition (link) BibTeX

Volume 83, Number 2, November 2001

• Florian Roussel, P. Rubio:
  About Skew Partitions in Minimal Imperfect Graphs. 171-190
  Electronic Edition (link) BibTeX
• Eli Berger:
  Dynamic Monopolies of Constant Size. 191-200
  Electronic Edition (link) BibTeX
• Daniel P. Sanders, Yue Zhao:
  Planar Graphs of Maximum Degree Seven are Class I. 201-212
  Electronic Edition (link) BibTeX
• Guantao Chen, Ronald J. Gould, Hao Li:
  Partitioning Vertices of a Tournament into Independent Cycles. 213-220
  Electronic Edition (link) BibTeX
• Tao Jiang:
  On a Conjecture about Trees in Graphs with Large Girth. 221-232
  Electronic Edition (link) BibTeX
• Abraham Berman, Xiao-Dong Zhang:
  On the Spectral Radius of Graphs with Cut Vertices. 233-240
  Electronic Edition (link) BibTeX
• Michael Krivelevich, Van H. Vu:
  Choosability in Random Hypergraphs. 241-257
  Electronic Edition (link) BibTeX
• Martin Kochol:
  An Equivalent Version of the 3-Flow Conjecture. 258-261
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. 262-271
  Electronic Edition (link) BibTeX
• Jason I. Brown, Carl A. Hickman, Alan D. Sokal, David G. Wagner:
  On the Chromatic Roots of Generalized Theta Graphs. 272-297
  Electronic Edition (link) BibTeX
• Criel Merino, Anna de Mier, Marc Noy:
  Irreducibility of the Tutte Polynomial of a Connected Matroid. 298-304
  Electronic Edition (link) BibTeX
• Matthias Kriesell:
  Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. 305-319
  Electronic Edition (link) BibTeX
• Michael U. Gerber, Alain Hertz:
  A Transformation Which Preserves the Clique Number. 320-330
  Electronic Edition (link) BibTeX
• Stéphan Thomassé:
  Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. 331-333
  Electronic Edition (link) BibTeX