Journal of Combinatorial Theory, Series B, Volume 98

Volume 98, Number 1, January 2008

• Xuding Zhu:
  Refined activation strategy for the marking game. 1-18
  
• Liangxia Wan, Yanpei Liu:
  Orientable embedding genus distribution for certain types of graphs. 19-32
  
• Jacob Fox, Csaba D. Tóth:
  On the decay of crossing numbers. 33-42
  
• Neil Robertson, Xiaoya Zha, Yue Zhao:
  On the flexibility of toroidal embeddings. 43-61
  
• Gábor Elek:
  Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality. 62-68
  
• Vladimir Nikiforov, Richard H. Schelp:
  Cycles and stability. 69-84
  
• Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit:
  Packing d-degenerate graphs. 85-94
  
• Frank Vallentin:
  Optimal distortion embeddings of distance regular graphs into Euclidean spaces. 95-104
  
• Robert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer:
  On the matching extendability of graphs in surfaces. 105-115
  
• Maria Chudnovsky, Paul D. Seymour:
  Solution of three problems of Cornuéjols. 116-135
  
• Matthias Kriesell:
  On the number of contractible triples in 3-connected graphs. 136-145
  
• László Lovász, Vera T. Sós:
  Generalized quasirandom graphs. 146-163
  
• Mahya Ghandehari, Hamed Hatami:
  Fourier analysis and large independent sets in powers of complete graphs. 164-172
  
• Nicolas Trotignon:
  Decomposing Berge graphs and detecting balanced skew partitions. 173-225
  
• Hal A. Kierstead, Alexandr V. Kostochka:
  An Ore-type theorem on equitable coloring. 226-234
  

• Xiangqian Zhou:
  A note on binary matroid with no M(K_{3, 3})-minor. 235-238
  

Volume 98, Number 2, March 2008

• Gareth A. Jones, Roman Nedela, Martin Skoviera:
  Complete bipartite graphs with a unique regular embedding. 241-248
  
• Maria Chudnovsky, Paul D. Seymour:
  Claw-free graphs. II. Non-orientable prismatic graphs. 249-290
  
• James G. Oxley, Charles Semple, Geoff Whittle:
  Wild triangles in 3-connected matroids. 291-323
  
• Yan-Quan Feng, Klavdija Kutnar, Aleksander Malnic, Dragan Marusic:
  On 2-fold covers of graphs. 324-341
  
• András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp:
  Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. 342-358
  
• Steve Wilson:
  Unexpected symmetries in unstable graphs. 359-383
  
• Oliver T. Dasbach, David Futer, Efstratia Kalfagianni, Xiao-Song Lin, Neal W. Stoltzfus:
  The Jones polynomial and graphs on surfaces. 384-399
  
• Christopher J. Hillar, Troels Windfeldt:
  Algebraic characterization of uniquely vertex colorable graphs. 400-414
  
• Dillon Mayhew, Gordon F. Royle:
  Matroids with nine elements. 415-431
  
• Marien Abreu, A. A. Diwan, Bill Jackson, Domenico Labbate, John Sheehan:
  Pseudo 2-factor isomorphic regular bipartite graphs. 432-442
  

• L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
  Boxicity and maximum degree. 443-445
  

Volume 98, Number 3, May 2008

• James G. Oxley, Charles Semple, Geoff Whittle:
  A chain theorem for matroids. 447-483
  
• Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
  3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. 484-505
  
• Sóstenes Lins, Emerson Oliveira-Lima, Valdenberg Silva:
  A homological solution for the Gauss code problem in arbitrary surfaces. 506-515
  
• Baogang Xu, Xingxing Yu:
  Triangle-free subcubic graphs with minimum bipartite density. 516-537
  
• Jim Geelen, Xiangqian Zhou:
  Generating weakly 4-connected matroids. 538-557
  
• Richard C. Brewster, Pavol Hell, Romeo Rizzi:
  Oriented star packings. 558-576
  
• Paul Balister, Béla Bollobás, Stefanie Gerke:
  Connectivity of addable graph classes. 577-584
  
• Jin Ho Kwak, Young Soo Kwon, Ju-Mok Oh:
  Infinitely many one-regular Cayley graphs on dihedral groups of any prescribed valency. 585-598
  
• Andrew J. Goodall:
  Parity, eulerian subgraphs and the Tutte polynomial. 599-628
  

Volume 98, Number 4, July 2008

• Gareth A. Jones, J. Mary Jones, Jürgen Wolfart:
  On the regularity of maps. 631-636
  
• Mike J. Grannell, Terry S. Griggs:
  A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs. 637-650
  
• D. Renault:
  The uniform locally finite tilings of the plane. 651-671
  
• Noga Alon, Uri Stav:
  The maximum edit distance from hereditary graph properties. 672-697
  
• Winfried Hochstättler, Robert Nickel:
  On the chromatic number of an oriented matroid. 698-706
  
• Rong Luo, Yue Zhao:
  Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic epsilon in {-1, -2, -3}. 707-720
  
• Chris D. Godsil, M. W. Newman:
  Eigenvalue bounds for independent sets. 721-734
  
• Guantao Chen, Yuan Chen, Shuhong Gao, Zhiquan Hu:
  Linked graphs with restricted lengths. 735-751
  
• Julia Böttcher, Mathias Schacht, Anusch Taraz:
  Spanning 3-colourable subgraphs of small bandwidth in dense graphs. 752-777
  
• Colin McDiarmid:
  Random graphs on surfaces. 778-797
  
• Philipp Sprüssel:
  End spaces of graphs are normal. 798-804
  
• Shinya Fujita, Ken-ichi Kawarabayashi:
  Connectivity keeping edges in graphs with large minimum degree. 805-811
  
• Maria Chudnovsky, Paul D. Seymour:
  Claw-free graphs. III. Circular interval graphs. 812-834
  
• Boris Pittel, Nicholas C. Wormald:
  Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172]. 835-837
  

Volume 98, Number 5, September 2008

• Maria Chudnovsky, Paul D. Seymour:
  Claw-free graphs. IV. Decomposition theorem. 839-938
  
• Robin Thomas, Paul Wollan:
  The extremal function for 3-linked graphs. 939-971
  
• Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan:
  A weaker version of Lovász' path removal conjecture. 972-979
  
• Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger:
  On the chromatic number of random graphs. 980-993
  
• Bernhard Krön, Rögnvaldur G. Möller:
  Quasi-isometries between graphs and trees. 994-1013
  
• Darryn E. Bryant, Daniel Horsley:
  Packing cycles in complete graphs. 1014-1037
  
• Serguei Norine, Robin Thomas:
  Minimally non-Pfaffian graphs. 1038-1055
  
• Jacob Fox, Benny Sudakov:
  On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs. 1056-1062
  
• Cai Heng Li:
  On finite edge transitive graphs and rotary maps. 1063-1075
  
• Primoz Sparl:
  A classification of tightly attached half-arc-transitive graphs of valency 4. 1076-1108
  
• Néstor E. Aguilera:
  Notes on "Ideal 0, 1 matrices" by Cornuéjols and Novick. 1109-1114
  
• Serguei Norine, Jean-Sébastien Sereni:
  Graphs with full rank 3-color matrix and few 3-colorings. 1115-1116
  

Volume 98, Number 6, November 2008

• Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
  Bisimplicial vertices in even-hole-free graphs. 1119-1164
  
• Daniela Kühn, Deryk Osthus, Andrew Young:
  k-Ordered Hamilton cycles in digraphs. 1165-1180
  
• Stefko Miklavic, Primoz Potocnik, Steve Wilson:
  Arc-transitive cycle decompositions of tetravalent graphs. 1181-1192
  
• Edward Dobson:
  On solvable groups and Cayley graphs. 1193-1214
  
• Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar:
  Locally planar graphs are 5-choosable. 1215-1232
  
• Tamás Király, Lap Chi Lau:
  Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs. 1233-1252
  
• John Mighton:
  A new characterization of graphic matroids. 1253-1258
  
• Ron Aharoni, Eli Berger, Ron Holzman, Ori Kfir:
  Independence - domination duality. 1259-1270
  
• Dino J. Lorenzini:
  Smith normal form and Laplacians. 1271-1300
  
• Maria Chudnovsky, Shmuel Safra:
  The Erdös-Hajnal conjecture for bull-free graphs. 1301-1310
  
• Talmage James Reid, Haidong Wu, Xiangqian Zhou:
  On minimally k-connected matroids. 1311-1324
  
• Genghua Fan, Hong-Jian Lai, Rui Xu, Cun-Quan Zhang, Chuixiang Zhou:
  Nowhere-zero 3-flows in triangularly connected graphs. 1325-1336
  
• Carsten Thomassen:
  2-List-coloring planar graphs without monochromatic triangles. 1337-1348
  
• Shao-Fei Du, Aleksander Malnic, Dragan Marusic:
  Classification of 2-arc-transitive dihedrants. 1349-1372
  
• Maria Chudnovsky, Paul D. Seymour:
  Claw-free graphs. V. Global structure. 1373-1410
  
• Alexandr V. Kostochka, Gexin Yu:
  Packing of graphs with small product of sizes. 1411-1415
  

Last update Tue May 21 19:14:40 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page