Journal of Combinatorial Theory, Series B, Volume 99

Volume 99, Number 1, January 2009

• Jim Geelen, Kasper Kabell:
  Projective geometries in dense matroids. 1-8
  Electronic Edition (link) BibTeX
• József Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós:
  The unlabelled speed of a hereditary graph property. 9-19
  Electronic Edition (link) BibTeX
• Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta:
  On the odd-minor variant of Hadwiger's conjecture. 20-29
  Electronic Edition (link) BibTeX
• Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee:
  Removable cycles in non-bipartite graphs. 30-38
  Electronic Edition (link) BibTeX
• Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
  Fast winning strategies in Maker-Breaker games. 39-47
  Electronic Edition (link) BibTeX
• Bryan Clair:
  Zeta functions of graphs with I actions. 48-61
  Electronic Edition (link) BibTeX
• Xuding Zhu:
  Bipartite subgraphs of triangle-free subcubic graphs. 62-83
  Electronic Edition (link) BibTeX
• Jamel Dammak, Gérard Lopez, Maurice Pouzet, Hamza Si Kaddour:
  Hypomorphy of graphs up to complementation. 84-96
  Electronic Edition (link) BibTeX
• Kiyoshi Ando, Yoshimi Egawa, K. Kawarabayashi, Matthias Kriesell:
  On the number of 4-contractible edges in 4-connected graphs. 97-109
  Electronic Edition (link) BibTeX
• Qing Cui, Jian Wang, Xingxing Yu:
  Hamilton circles in infinite planar graphs. 110-138
  Electronic Edition (link) BibTeX
• Yusuke Kobayashi, Kenjiro Takazawa:
  Even factors, jump systems, and discrete convexity. 139-161
  Electronic Edition (link) BibTeX
• Klavdija Kutnar, Dragan Marusic:
  A complete classification of cubic symmetric graphs of girth 6. 162-184
  Electronic Edition (link) BibTeX
• Primoz Potocnik, Mateja Sajna:
  Brick assignments and homogeneously almost self-complementary graphs. 185-201
  Electronic Edition (link) BibTeX
• David J. Grynkiewicz, Vsevolod F. Lev, Oriol Serra:
  Connectivity of addition Cayley graphs. 202-217
  Electronic Edition (link) BibTeX
• Martin Grohe, Dániel Marx:
  On tree width, bramble size, and expansion. 218-228
  Electronic Edition (link) BibTeX
• Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki:
  N-flips in even triangulations on surfaces. 229-246
  Electronic Edition (link) BibTeX
• Jim Geelen, Bert Gerards:
  Excluding a group-labelled graph. 247-253
  Electronic Edition (link) BibTeX
• Marston D. E. Conder, Young Soo Kwon, Jozef Sirán:
  Reflexibility of regular Cayley maps for abelian groups. 254-260
  Electronic Edition (link) BibTeX
• Wei Wang:
  A uniqueness theorem on matrices and reconstruction. 261-265
  Electronic Edition (link) BibTeX
• Yeh-jong Pan, Chih-wen Weng:
  A note on triangle-free distance-regular graphs with a₂!=0. 266-270
  Electronic Edition (link) BibTeX
• Marien Abreu, Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan:
  Corrigendum to "Graphs and digraphs with all 2-factors isomorphic" [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]. 271-273
  Electronic Edition (link) BibTeX

Volume 99, Number 2, March 2009

• Henning Bruhn, Reinhard Diestel:
  MacLane's theorem for arbitrary surfaces. 275-286
  Electronic Edition (link) BibTeX
• Sebastian M. Cioaba, David A. Gregory, Willem H. Haemers:
  Matchings in regular graphs from eigenvalues. 287-297
  Electronic Edition (link) BibTeX
• Hal A. Kierstead, Alexandr V. Kostochka:
  Ore-type versions of Brooks' theorem. 298-305
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  On the sum of k largest eigenvalues of graphs and symmetric matrices. 306-313
  Electronic Edition (link) BibTeX
• D. Gonçalves:
  Covering planar graphs with forests, one having bounded maximum degree. 314-322
  Electronic Edition (link) BibTeX
• Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar:
  Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]. 323
  Electronic Edition (link) BibTeX
• Baogang Xu, Xingxing Yu:
  Judicious k-partitions of graphs. 324-337
  Electronic Edition (link) BibTeX
• David G. Wagner:
  Weighted enumeration of spanning subgraphs with degree constraints. 347-357
  Electronic Edition (link) BibTeX
• Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal:
  Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. 358-369
  Electronic Edition (link) BibTeX
• Maria Chudnovsky, Paul D. Seymour:
  Even pairs in Berge graphs. 370-377
  Electronic Edition (link) BibTeX
• Robert Gray:
  k-CS-transitive infinite graphs. 378-398
  Electronic Edition (link) BibTeX
• Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
  On mod (2p+1)-orientations of graphs. 399-406
  Electronic Edition (link) BibTeX
• Jim Geelen, Kasper Kabell:
  The Erdös-Pósa property for matroid circuits. 407-419
  Electronic Edition (link) BibTeX
• Jim Geelen, Joseph P. S. Kung, Geoff Whittle:
  Growth rates of minor-closed classes of matroids. 420-427
  Electronic Edition (link) BibTeX
• Gregory B. Sorkin, Angelika Steger, Rico Zenklusen:
  A tight bound on the collection of edges in MSTs of induced subgraphs. 428-435
  Electronic Edition (link) BibTeX
• Jácint Szabó:
  Good characterizations for some degree constrained subgraphs. 436-446
  Electronic Edition (link) BibTeX
• Cai Heng Li:
  Vertex transitive embeddings of complete graphs. 447-454
  Electronic Edition (link) BibTeX
• Marston D. E. Conder:
  Regular maps and hypermaps of Euler characteristic -1 to -200. 455-459
  Electronic Edition (link) BibTeX
• Ryan Dotson, Brendan Nagle:
  Hereditary properties of hypergraphs. 460-473
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  The chromatic polynomial and list colorings. 474-479
  Electronic Edition (link) BibTeX
• Ju-Mok Oh:
  Regular t-balanced Cayley maps on semi-dihedral groups. 480-493
  Electronic Edition (link) BibTeX
• Jacob Fox, Po-Shen Loh, Benny Sudakov:
  Large induced trees in K_r-free graphs. 494-501
  Electronic Edition (link) BibTeX
• Alexander Schrijver:
  Graph invariants in the spin model. 502-511
  Electronic Edition (link) BibTeX
• Hein van der Holst:
  A polynomial-time algorithm to find a linkless embedding of a graph. 512-530
  Electronic Edition (link) BibTeX