Journal of Combinatorial Theory, Series B, Volume 88

Volume 88, Number 1, May 2003

• Michal Karonski, Boris Pittel:
  Existence of a perfect matching in a random (1+e^-1)--out bipartite graph. 1-16
  Electronic Edition (link) BibTeX
• Oleg V. Borodin, André Raspaud:
  A sufficient condition for planar graphs to be 3-colorable. 17-27
  Electronic Edition (link) BibTeX
• Daniela Kühn, Deryk Osthus:
  Partitions of graphs with high minimum degree or connectivity. 29-43
  Electronic Edition (link) BibTeX
• Jacques Verstraëte:
  Vertex-disjoint cycles of the same length. 45-52
  Electronic Edition (link) BibTeX
• Matthias Kriesell:
  Edge-disjoint trees containing some given vertices in a graph. 53-65
  Electronic Edition (link) BibTeX
• Marston D. E. Conder, Dragan Marusic:
  A tetravalent half-arc-transitive graph with non-abelian vertex stabilizer. 67-76
  Electronic Edition (link) BibTeX
• Alex R. Berg, Tibor Jordán:
  A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. 77-97
  Electronic Edition (link) BibTeX
• Benny Sudakov:
  A few remarks on Ramsey-Tura'n-type problems. 99-106
  Electronic Edition (link) BibTeX
• Paul N. Balister:
  Packing closed trails into dense graphs. 107-118
  Electronic Edition (link) BibTeX
• Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz:
  On random planar graphs, the number of planar graphs and their triangulations. 119-134
  Electronic Edition (link) BibTeX
• David A. Gregory, Brenda Heyink, Kevin N. Vander Meulen:
  Inertia and biclique decompositions of joins of graphs. 135-151
  Electronic Edition (link) BibTeX
• Nicolau C. Saldanha, Carlos Tomei:
  Tilings of quadriculated annuli. 153-183
  Electronic Edition (link) BibTeX
• Hector A. Juarez, Gelasio Salazar:
  Optimal meshes of curves in the Klein bottle. 185-188
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  A short list color proof of Grötzsch's theorem. 189-192
  Electronic Edition (link) BibTeX

Volume 88, Number 2, July 2003

• Atsushi Kaneko:
  A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. 195-218
  Electronic Edition (link) BibTeX
• Matt DeVos, Paul D. Seymour:
  Extending partial 3-colourings in a planar graph. 219-225
  Electronic Edition (link) BibTeX
• Akira Saito:
  Splitting and contractible edges in 4-connected graphs. 227-235
  Electronic Edition (link) BibTeX
• Hiroshi Maehara:
  Plane graphs with straight edges whose bounded faces are acute triangles. 237-245
  Electronic Edition (link) BibTeX
• Zoltán Szigeti:
  On the graphic matroid parity problem. 247-260
  Electronic Edition (link) BibTeX
• James F. Geelen, A. M. H. Gerards, Neil Robertson, Geoff Whittle:
  On the excluded minors for the matroids of branch-width k. 261-265
  Electronic Edition (link) BibTeX
• Anthony J. W. Hilton, Matthew Johnson, Christopher A. Rodger, Evan B. Wantland:
  Amalgamations of connected k-factorizations. 267-279
  Electronic Edition (link) BibTeX
• Penny E. Haxell, Tibor Szabó, Gábor Tardos:
  Bounded size components--partitions and transversals. 281-297
  Electronic Edition (link) BibTeX
• Hossein Hajiabolhassan, Xuding Zhu:
  Circular chromatic number of Kneser graphs. 299-303
  Electronic Edition (link) BibTeX
• Jiuqiang Liu:
  Hamiltonian decompositions of Cayley graphs on abelian groups of even order. 305-321
  Electronic Edition (link) BibTeX
• José Coelho de Pina, José Soares:
  Improved bound for the Carathéodory rank of the bases of a matroid. 323-327
  Electronic Edition (link) BibTeX
• Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov:
  Maximum cuts and judicious partitions in graphs without short cycles. 329-346
  Electronic Edition (link) BibTeX
• Petr Hlinený:
  Crossing-number critical graphs have bounded path-width. 347-367
  Electronic Edition (link) BibTeX
• Ed Swartz:
  g-Elements of matroid complexes. 369-375
  Electronic Edition (link) BibTeX
• James F. Geelen, Satoru Iwata, Kazuo Murota:
  The linear delta-matroid parity problem. 377-398
  Electronic Edition (link) BibTeX
• Jens Vygen:
  A note on Schrijver's submodular function minimization algorithm. 399-402
  Electronic Edition (link) BibTeX