Journal of Combinatorial Theory, Series B, Volume 91

Volume 91, Number 1, May 2004

• József Balogh, Béla Bollobás, Miklós Simonovits:
  The number of graphs without forbidden subgraphs. 1-24
  Electronic Edition (link) BibTeX
• Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan:
  Excluding any graph as a minor allows a low tree-width 2-coloring. 25-41
  Electronic Edition (link) BibTeX
• Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei:
  Long cycles in triangle-free graphs with prescribed independence number and connectivity. 43-55
  Electronic Edition (link) BibTeX
• Fred C. Holroyd, Martin Koviera:
  Colouring of cubic graphs by Steiner triple systems. 57-66
  Electronic Edition (link) BibTeX
• Iiro S. Honkala, Tero Laihonen:
  On identification in the triangular grid. 67-86
  Electronic Edition (link) BibTeX
• Mark E. Watkins, Jack E. Graver:
  A characterization of infinite planar primitive graphs. 87-104
  Electronic Edition (link) BibTeX
• James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle:
  A short proof of non-GF(5)-representability of matroids. 105-121
  Electronic Edition (link) BibTeX
• Serguei Norine, Charles H. C. Little, Kee L. Teo:
  A new proof of a characterisation of Pfaffian bipartite graphs. 123-126
  Electronic Edition (link) BibTeX
• Mark S. MacLean:
  Taut distance-regular graphs of even diameter. 127-142
  Electronic Edition (link) BibTeX
• Dragan Stevanovic:
  The largest eigenvalue of nonregular graphs. 143-146
  Electronic Edition (link) BibTeX

Volume 91, Number 2, July 2004

• Shlomo Hoory, Nathan Linial:
  Colorings of the d-regular infinite tree. 161-167
  Electronic Edition (link) BibTeX
• Hirobumi Mizuno, Iwao Sato:
  Weighted zeta functions of graphs. 169-183
  Electronic Edition (link) BibTeX
• Tamás Király:
  Covering symmetric supermodular functions by uniform hypergraphs. 185-200
  Electronic Edition (link) BibTeX
• Gyula Pap, László Szegö:
  On the maximum even factor in weakly symmetric graphs. 201-213
  Electronic Edition (link) BibTeX
• Yair Caro, Raphael Yuster:
  Edge coloring complete uniform hypergraphs with many components. 215-227
  Electronic Edition (link) BibTeX
• Dan Archdeacon, C. Paul Bonnington:
  Obstructions for embedding cubic graphs on the spindle surface. 229-252
  Electronic Edition (link) BibTeX
• Vladimir P. Korzhik, Heinz-Jürgen Voss:
  Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. 253-287
  Electronic Edition (link) BibTeX
• Primoz Potocnik:
  Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms. 289-300
  Electronic Edition (link) BibTeX
• Xiaotie Deng, Guojun Li, Wenan Zang:
  Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs. 301-325
  Electronic Edition (link) BibTeX
• Xiangqian Zhou:
  On internally 4-connected non-regular binary matroids. 327-343
  Electronic Edition (link) BibTeX
• Gordon F. Royle, Alan D. Sokal:
  The Brown-Colbourn conjecture on zeros of reliability polynomials is false. 345-360
  Electronic Edition (link) BibTeX