Journal of Graph Theory, Volume 46

Volume 46, Number 1, May 2004

• András Gyárfás, T. Jensen, Michael Stiebitz:
  On graphs with strongly independent color-classes. 1-14
  Electronic Edition (link) BibTeX
• Mike J. Grannell, Terry S. Griggs, Martin Knor, Martin Skoviera:
  A Steiner triple system which colors all cubic graphs. 15-24
  Electronic Edition (link) BibTeX
• Tomás Kaiser, Riste Skrekovski:
  Planar graph colorings without short monochromatic cycles. 25-38
  Electronic Edition (link) BibTeX
• János Pach, Géza Tóth:
  Monotone drawings of planar graphs. 39-47
  Electronic Edition (link) BibTeX
• Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo:
  On the number of quasi-kernels in digraphs. 48-56
  Electronic Edition (link) BibTeX
• Zhishi Pan, Xuding Zhu:
  Density of the circular chromatic numbers of series-parallel graphs. 57-68
  Electronic Edition (link) BibTeX
• Charles Dunn, Hal A. Kierstead:
  The relaxed game chromatic number of outerplanar graphs. 69-78
  Electronic Edition (link) BibTeX
• Jingzhong Mao, Lingli Sun:
  Erratum to: The structure of geodetic blocks with diameter two. 79-80
  Electronic Edition (link) BibTeX

Volume 46, Number 2, June 2004

• Yue Zhao:
  New lower bounds for the size of edge chromatic critical graphs. 81-92
  Electronic Edition (link) BibTeX
• Bianca Spille, László Szegö:
  A Gallai-Edmonds-type structure theorem for path-matchings. 93-102
  Electronic Edition (link) BibTeX
• Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
  Regular 4-critical graphs of even degree. 103-130
  Electronic Edition (link) BibTeX
• Béla Bollobás, Alex D. Scott:
  Judicious partitions of bounded-degree graphs. 131-143
  Electronic Edition (link) BibTeX
• Douglas Bauer, T. Niessen, Edward F. Schmeichel:
  Toughness, minimum degree, and spanning cubic subgraphs. 144
  Electronic Edition (link) BibTeX

Volume 46, Number 3, July 2004

• Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
  Vertex-disjoint cycles containing specified vertices in a bipartite graph. 145-166
  Electronic Edition (link) BibTeX
• Yuri Matiyasevich:
  Some probabilistic restatements of the Four Color Conjecture. 167-179
  Electronic Edition (link) BibTeX
• Tao Jiang:
  A note on a conjecture about cycles with many incident chords. 180-182
  Electronic Edition (link) BibTeX
• Petr Hlinený, Robin Thomas:
  On possible counterexamples to Negami's planar cover conjecture. 183-206
  Electronic Edition (link) BibTeX
• Dan Archdeacon, Joanna A. Ellis-Monaghan, D. Fisher, Dalibor Froncek, Peter Che Bor Lam, S. Seager, B. Wei, Raphael Yuster:
  Some remarks on domination. 207-210
  Electronic Edition (link) BibTeX
• András Gyárfás, Gábor Simonyi:
  Edge colorings of complete graphs without tricolored triangles. 211-216
  Electronic Edition (link) BibTeX
• Igor E. Zverovich, Inessa I. Zverovich:
  Forbidden induced subgraph characterization of cograph contractions. 217-226
  Electronic Edition (link) BibTeX
• Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar:
  The circular chromatic number of a digraph. 227-240
  Electronic Edition (link) BibTeX

Volume 46, Number 4, August 2004

• József Balogh, Pascal Ochem, András Pluhár:
  On the interval number of special graphs. 241-253
  Electronic Edition (link) BibTeX
• Mekkia Kouider, Zbigniew Lonc:
  Stability number and [a, b]-factors in graphs. 254-264
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen, Jing Huang, Anders Yeo:
  Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments. 265-284
  Electronic Edition (link) BibTeX
• Karen L. Collins, Kimberly Tysdal:
  Dependent edges in Mycielski graphs and 4-colorings of 4-skeletons. 285-296
  Electronic Edition (link) BibTeX
• Young Soo Kwon:
  New regular embeddings of n-cubes Q_n. 297-312
  Electronic Edition (link) BibTeX
• Pavol Hell, Jing Huang:
  Interval bigraphs and circular arc graphs. 313-327
  Electronic Edition (link) BibTeX