Journal of Combinatorial Theory, Series B, Volume 97

Volume 97, Number 1, January 2007

• Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu:
  The circular chromatic index of graphs of high girth. 1-13
  
• Stefko Miklavic, Primoz Potocnik:
  Distance-regular Cayley graphs on dihedral groups. 14-33
  
• Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger:
  Small subsets inherit sparse epsilon-regularity. 34-56
  
• Cai Heng Li, Jozef Sirán:
  Möbius regular maps. 57-73
  
• Koenraad Audenaert, Chris D. Godsil, Gordon F. Royle, Terry Rudolph:
  Symmetric squares of graphs. 74-90
  
• Bruno Courcelle, Sang-il Oum:
  Vertex-minors, monadic second-order logic, and a conjecture by Seese. 91-126
  
• Bill Jackson:
  A zero-free interval for flow polynomials of cubic graphs. 127-143
  
• Ken-ichi Kawarabayashi:
  On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture. 144-150
  

• Dhruv Mubayi, Vojtech Rödl:
  On the chromatic number and independence number of hypergraph products. 151-155
  
• Carsten Thomassen:
  Hajós' conjecture for line graphs. 156-157
  

Volume 97, Number 2, March 2007

• Türker Bíyíkoglu, Josef Leydold:
  Faber-Krahn type inequalities for trees. 159-174
  
• Victor Chepoi:
  Basis graphs of even Delta-matroids. 175-192
  
• Béla Bollobás, Alex D. Scott:
  Separating systems and oriented graphs of diameter two. 193-203
  
• Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot:
  A note on the jumping constant conjecture of Erdös. 204-216
  
• Primoz Potocnik, Steve Wilson:
  Tetravalent edge-transitive graphs of girth at most 4. 217-236
  
• Yusuke Suzuki:
  Graphs that triangulate a given surface and quadrangulate another surface. 237-244
  
• Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige:
  Integer and fractional packings of hypergraphs. 245-268
  
• Colin Cooper, Alan M. Frieze:
  The cover time of the preferential attachment graph. 269-290
  

Volume 97, Number 3, May 2007

• Gregory L. Cherlin, Saharon Shelah:
  Universal graphs with a forbidden subtree. 293-333
  
• Carsten Thomassen:
  Many 3-colorings of triangle-free planar graphs. 334-349
  
• Maria Chudnovsky, Paul D. Seymour:
  The roots of the independence polynomial of a clawfree graph. 350-357
  
• Matthias Kriesell:
  A constructive characterization of 3-connected triangle-free graphs. 358-370
  
• Edward Dobson, Aleksander Malnic, Dragan Marusic, Lewis A. Nowitz:
  Semiregular automorphisms of vertex-transitive graphs of certain valencies. 371-380
  
• Drago Bokal:
  On the crossing numbers of Cartesian products with paths. 381-384
  
• Sang-il Oum, Paul D. Seymour:
  Testing branch-width. 385-393
  
• Reza Naserasr:
  Homomorphisms and edge-colourings of planar graphs. 394-400
  
• Mark N. Ellingham, Ken-ichi Kawarabayashi:
  2-Connected spanning subgraphs with low maximum degree in locally planar graphs. 401-412
  
• Feng Ming Dong, Khee Meng Koh:
  Bounds for the coefficients of flow polynomials. 413-420
  
• Hongyu He:
  Reconstruction and higher-dimensional geometry. 421-429
  
• Daniel R. L. Brown, David M. Jackson:
  A rooted map invariant, non-orientability and Jack symmetric functions. 430-452
  
• Marston Conder, Robert Jajcay, Tom Tucker:
  Regular t-balanced Cayley maps. 453-473
  
• Enrique García Moreno Esteva, Tommy R. Jensen:
  On semiextensions and circuit double covers. 474-482
  

• Sebastian M. Cioaba, David A. Gregory, Vladimir Nikiforov:
  Extreme eigenvalues of nonregular graphs. 483-486
  

Volume 97, Number 4, July 2007

• Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
  Removing even crossings. 489-500
  
• Joan P. Hutchinson, Emily H. Moore:
  Distance constraints in graph color extensions. 501-517
  
• András Sebö:
  Minmax relations for cyclically ordered digraphs. 518-552
  
• Gasper Fijavz:
  Contractions of 6-connected toroidal graphs. 553-570
  
• Carsten Thomassen:
  Exponentially many 5-list-colorings of planar graphs. 571-583
  
• Agnieszka Figaj, Tomasz Luczak:
  The Ramsey number for a triple of long even cycles. 584-596
  
• Matthew Johnson:
  Amalgamations of factorizations of complete graphs. 597-611
  
• Boris Bukh, Benny Sudakov:
  Induced subgraphs of Ramsey graphs with many distinct degrees. 612-619
  
• Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé:
  Paths with two blocks in n-chromatic digraphs. 620-626
  
• Yan-Quan Feng, Jin Ho Kwak:
  Cubic symmetric graphs of order a small number times a prime or a prime square. 627-646
  
• Ken-ichi Kawarabayashi, Bojan Mohar:
  A relaxed Hadwiger's Conjecture for list colorings. 647-651
  
• Robert Berke, Tibor Szabó:
  Relaxed two-coloring of cubic graphs. 652-668
  
• Dhruv Mubayi, Oleg Pikhurko:
  A new generalization of Mantel's theorem to k-graphs. 669-678
  

Volume 97, Number 5, September 2007

• Illya V. Hicks, Nolan B. McMurray Jr.:
  The branchwidth of graphs and their cycle matroids. 681-692
  
• Daniel C. Slilaty:
  Projective-planar signed graphs and tangled signed graphs. 693-717
  
• Isolde Adler:
  Directed tree-width examples. 718-725
  
• Mei Lu, Huiqing Liu, Feng Tian:
  Laplacian spectral bounds for clique and independence numbers of graphs. 726-732
  
• L. Sunil Chandran, Naveen Sivadasan:
  Boxicity and treewidth. 733-744
  
• Mark Bilinski, Young Soo Kwon, Xingxing Yu:
  On the reconstruction of planar graphs. 745-756
  
• Marston Conder, Roman Nedela:
  Symmetric cubic graphs of small girth. 757-768
  
• Serguei Norine, Robin Thomas:
  Generating bricks. 769-817
  
• Zai Ping Lu:
  Primitive half-transitive graphs constructed from the symmetric groups of prime degrees. 818-826
  
• Mark N. Ellingham, D. Christopher Stephens:
  The nonorientable genus of joins of complete graphs with large edgeless graphs. 827-845
  
• Vadim V. Lozin, Dieter Rautenbach:
  The relative clique-width of a graph. 846-858
  

• Béla Bollobás, Vladimir Nikiforov:
  Cliques and the spectral radius. 859-865
  

Volume 97, Number 6, November 2007

• Maria Chudnovsky, Paul D. Seymour:
  Claw-free graphs. I. Orientable prismatic graphs. 867-903
  
• Po-Shen Loh, Benny Sudakov:
  Independent transversals in locally sparse graphs. 904-918
  
• Peter Keevash, Yi Zhao:
  Codegree problems for projective geometries. 919-928
  
• Norihide Tokushige:
  Multiply-intersecting families revisited. 929-948
  
• Anders Yeo:
  Paths and cycles containing given arcs, in close to regular multipartite tournaments. 949-963
  
• Luis A. Goddyn, R. Bruce Richter, Jozef Sirán:
  Triangular embeddings of complete graphs from graceful labellings of paths. 964-970
  
• Jim Geelen, Bert Gerards, Geoff Whittle:
  Excluding a planar graph from GF(q)-representable matroids. 971-998
  
• Joseph Lauer, Nicholas C. Wormald:
  Large independent sets in regular graphs of large girth. 999-1009
  
• Bolian Liu, Jian Shen, Xinmao Wang:
  On the largest eigenvalue of non-regular graphs. 1010-1018
  
• Thomas Zaslavsky:
  Biased graphs. VII. Contrabalance and antivoltages. 1019-1040
  
• Oleg Pikhurko, Teresa Sousa:
  Minimum H-decompositions of graphs. 1041-1055
  
• Jonah Blasiak:
  A special case of Hadwiger's conjecture. 1056-1073
  

• Jirí Fink:
  Perfect matchings extend to Hamilton cycles in hypercubes. 1074-1076
  

Last update Fri May 25 09:30:47 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page