Journal of Combinatorial Theory, Series B, Volume 90

Volume 90, Number 1, January 2004

• William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason:
  To Adrian Bondy and U. S. R. Murty. 1
  Electronic Edition (link) BibTeX
• Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp:
  Balanced edge colorings. 3-20
  Electronic Edition (link) BibTeX
• Jay Adamsson, R. Bruce Richter:
  Arrangements, circular arrangements and the crossing number of C₇X C_n. 21-39
  Electronic Edition (link) BibTeX
• Peter Keevash, Benny Sudakov:
  On the number of edges not covered by monochromatic copies of a fixed graph. 41-53
  Electronic Edition (link) BibTeX
• Michael S. Lang:
  A new inequality for bipartite distance-regular graphs. 55-91
  Electronic Edition (link) BibTeX
• Charles Dunn, Hal A. Kierstead:
  A simple competitive graph coloring algorithm II. 93-106
  Electronic Edition (link) BibTeX
• Daniel Král, Heinz-Jürgen Voss:
  Edge-disjoint odd cycles in planar graphs. 107-120
  Electronic Edition (link) BibTeX
• Thomas Q. Sibley:
  On classifying finite edge colored graphs with two transitive automorphism groups. 121-138
  Electronic Edition (link) BibTeX
• Martin Kochol:
  Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks. 139-145
  Electronic Edition (link) BibTeX
• Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West:
  Homomorphisms from sparse graphs with large girth. 147-159
  Electronic Edition (link) BibTeX
• Jaroslav Nesetril, Xuding Zhu:
  On sparse graphs with given colorings and homomorphisms. 161-172
  Electronic Edition (link) BibTeX
• Hongxun Qin, Xiangqian Zhou:
  The class of binary matroids with no M(K_{3, 3})-, M ast (K_{3, 3})-, M(K₅)- or M ast (K₅)-minor . 173-184
  Electronic Edition (link) BibTeX
• Jin Ho Kwak, Ju-Mok Oh:
  Infinitely many finite one-regular graphs of any even valency. 185-191
  Electronic Edition (link) BibTeX

Volume 90, Number 2, March 2004

• Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald:
  Hamiltonian decompositions of random bipartite regular graphs. 195-222
  Electronic Edition (link) BibTeX
• Paul R. Hafner:
  Geometric realisation of the graphs of McKay-Miller-Sirán. 223-232
  Electronic Edition (link) BibTeX
• Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana:
  Weakly distance-regular digraphs. 233-255
  Electronic Edition (link) BibTeX
• Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
  Square-free perfect graphs. 257-307
  Electronic Edition (link) BibTeX
• David R. Wood:
  Bounded degree acyclic decompositions of digraphs. 309-313
  Electronic Edition (link) BibTeX
• Ken-ichi Kawarabayashi:
  Cycles through a prescribed vertex set in N-connected graphs. 315-323
  Electronic Edition (link) BibTeX
• Neil Robertson, Paul D. Seymour:
  Graph Minors. XIX. Well-quasi-ordering on a surface. 325-385
  Electronic Edition (link) BibTeX