Journal of Combinatorial Theory, Series B, Volume 96

Volume 96, Number 1, January 2006

• Frédéric Maffray, Nicolas Trotignon:
  A class of perfectly contractile graphs. 1-19
  
• Michael Stiebitz, Riste Skrekovski:
  A map colour theorem for the union of graphs. 20-37
  
• Federico Ardila, Caroline J. Klivans:
  The Bergman complex of a matroid and phylogenetic trees. 38-49
  
• Joseph P. S. Kung:
  A Tutte decomposition for matrices and bimatroids. 50-66
  
• Yan-Quan Feng:
  Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets. 67-72
  
• Daniela Kühn, Deryk Osthus:
  Extremal connectivity for topological cliques in bipartite graphs. 73-99
  
• Daniel Král:
  Extending partial 5-colorings and 6-colorings in planar graphs. 100-110
  
• Joel Friedman, Ram Murty, Jean-Pierre Tillich:
  Spectral estimates for Abelian Cayley graphs. 111-121
  
• Dhruv Mubayi:
  A hypergraph extension of Turán's theorem. 122-134
  
• Manoel Lemos, James G. Oxley:
  Matroid packing and covering with circuits through an element. 135-158
  
• Judith Keijsper, Rudi Pendavingh, Leen Stougie:
  A linear programming formulation of Mader's edge-disjoint paths problem. 159-163
  
• Cai Heng Li, Zai Ping Lu, Hua Zhang:
  Tetravalent edge-transitive Cayley graphs with odd number of vertices. 164-181
  

Volume 96, Number 2, March 2006

• Roland Häggkvist, Klas Markström:
  Cycle double covers and spanning minors I. 183-206
  
• Andrew J. Goodall:
  Some new evaluations of the Tutte polynomial. 207-224
  
• Henning Bruhn, Maya Jakobine Stein:
  MacLane's planarity criterion for locally finite graphs. 225-239
  
• Zi-Xia Song, Robin Thomas:
  The extremal function for K₉ minors. 240-252
  
• Christopher Carl Heckman, Robin Thomas:
  Independent sets in triangle-free cubic planar graphs. 253-275
  
• Su Jianji, Yuan Xudong:
  A new degree sum condition for the existence of a contractible edge in a kappa-connected graph. 276-295
  
• Ken-ichi Kawarabayashi, Paul Wollan:
  Non-zero disjoint cycles in highly connected group labelled graphs. 296-301
  
• Maya Jakobine Stein:
  Arboricity and tree-packing in locally finite graphs. 302-312
  

Volume 96, Number 3, May 2006

• Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito:
  A pair of forbidden subgraphs and perfect matchings. 315-324
  
• Petr Hlinený:
  Branch-width, parse trees, and monadic second-order logic for matroids. 325-351
  
• Michael U. Gerber, Alain Hertz, Vadim V. Lozin:
  Augmenting chains in graphs without a skew star. 352-366
  
• Sebastian M. Cioaba:
  On the extreme eigenvalues of regular graphs. 367-373
  
• Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler:
  Dominating sets in k-majority tournaments. 374-387
  
• Hein van der Holst:
  Graphs and obstructions in four dimensions. 388-404
  
• James F. Geelen, Bert Gerards, Geoff Whittle:
  On Rota's conjecture and excluded minors containing large projective geometries. 405-425
  
• Vladimir P. Korzhik:
  On the maximal distance between triangular embeddings of a complete graph. 426-435
  

• Nathan Linial, Eran London:
  On the expansion rate of Margulis expanders. 436-442
  

Volume 96, Number 4, July 2006

• Juan José Montellano-Ballesteros, Ricardo Strausz:
  A characterization of cocircuit graphs of uniform oriented matroids. 445-454
  
• Petr Hlinený:
  Crossing number is hard for cubic graphs. 455-471
  
• Michael O. Albertson, Douglas B. West:
  Extending precolorings to circular colorings. 472-481
  
• Xingxing Yu, Florian Zickfeld:
  Reducing Hajós' 4-coloring conjecture to 4-connected graphs. 482-492
  
• Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
  Hamiltonicity in 3-connected claw-free graphs. 493-504
  
• Serguei Norine, Robin Thomas:
  Minimal bricks. 505-513
  
• Sang-il Oum, Paul D. Seymour:
  Approximating clique-width and branch-width. 514-528
  
• Mark N. Ellingham, Chris Stephens, Xiaoya Zha:
  The nonorientable genus of complete tripartite graphs. 529-559
  
• James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle:
  Obstructions to branch-decomposition of matroids. 560-570
  
• Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
  Every 3-connected, essentially 11-connected line graph is Hamiltonian. 571-576
  
• Saieed Akbari, Vahab S. Mirrokni, Bashir S. Sadjad:
  A relation between choosability and uniquely list colorability. 577-583
  
• Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
  Short paths in quasi-random triple systems with sparse underlying graphs. 584-607
  

• Yonatan Bilu:
  Tales of Hoffman: Three extensions of Hoffman's bound on the graph chromatic number. 608-613
  
• Peter Keevash, Benny Sudakov:
  Sparse halves in triangle-free graphs. 614-620
  

Volume 96, Number 5, September 2006

• Mireille Bousquet-Mélou, Arnaud Jehanne:
  Polynomial equations with one catalytic variable, algebraic series and map enumeration. 623-672
  
• Jing Huang:
  Representation characterizations of chordal bipartite graphs. 673-683
  
• Zoltán Király, Zoltán Szigeti:
  Simultaneous well-balanced orientations of graphs. 684-692
  
• David Hartvigsen:
  Finding maximum square-free 2-matchings in bipartite graphs. 693-705
  
• Alexander Mednykh, Roman Nedela:
  Enumeration of unrooted maps of a given genus. 706-729
  
• Jaroslav Nesetril, Patrice Ossona de Mendez:
  Folding. 730-739
  
• Bojan Mohar:
  Tree amalgamation of graphs and tessellations of the Cantor sphere. 740-753
  

• Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan:
  Proper minor-closed families are small. 754-757
  
• Lilian Matthiesen:
  There are uncountably many topological types of locally finite trees. 758-760
  

• Dragan Marusic:
  Corrigendum to "On 2-arc-transitivity of Cayley graphs" [J. Combin. Theory Series B 87 (2003) 162-196]. 761-764
  

Volume 96, Number 6, November 2006

• Daniela Kühn, Deryk Osthus:
  Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. 767-821
  
• Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang:
  The circumference of a graph with no K_{3, t}-minor. 822-845
  
• Reinhard Diestel:
  End spaces and spanning trees. 846-854
  
• András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
  An improved bound for the monochromatic cycle partition number. 855-873
  
• Anthony Bonato, Claude Tardif:
  Mutually embeddable graphs and the tree alternative conjecture. 874-880
  
• Matthias Kriesell:
  Contractions, cycle double covers, and cyclic colorings in locally connected graphs. 881-900
  
• Matthias Beck, Thomas Zaslavsky:
  The number of nowhere-zero flows on graphs and signed graphs. 901-918
  
• József Balogh, Peter Keevash, Benny Sudakov:
  On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. 919-932
  
• László Lovász, Balázs Szegedy:
  Limits of dense graph sequences. 933-957
  

• Baogang Xu:
  On 3-colorable plane graphs without 5- and 7-cycles. 958-963
  
• Thom Sulanke:
  Note on the irreducible triangulations of the Klein bottle. 964-972