Journal of Graph Theory, Volume 47

Volume 47, Number 1, September 2004

• Michael J. Pelsmajer:
  Equitable list-coloring for graphs of maximum degree 3. 1-8
  Electronic Edition (link) BibTeX
• Maria Axenovich, Tao Jiang, André Kündgen:
  Bipartite anti-Ramsey numbers of cycles. 9-28
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen, Stephan Brandt:
  Subgraphs in vertex neighborhoods of K_r-free graphs. 29-38
  Electronic Edition (link) BibTeX
• Vladimir Nikiforov, Richard H. Schelp:
  Cycles and paths in graphs with large minimal degree. 39-52
  Electronic Edition (link) BibTeX
• Lev Yu. Glebsky, Gelasio Salazar:
  The crossing number of C_m × C_n is as conjectured for n >= m(m + 1). 53-72
  Electronic Edition (link) BibTeX

Volume 47, Number 2, October 2004

• Michael Plantholt:
  Overfull conjecture for graphs with high minimum degree. 73-80
  Electronic Edition (link) BibTeX
• Tomasz Luczak, Jaroslav Nesetril:
  Note on projective graphs. 81-86
  Electronic Edition (link) BibTeX
• F. Havet:
  Pancyclic arcs and connectivity in tournaments. 87-110
  Electronic Edition (link) BibTeX
• Tomasz Luczak, Florian Pfender:
  Claw-free 3-connected P₁₁-free graphs are hamiltonian. 111-121
  Electronic Edition (link) BibTeX
• Artem V. Pyatkin:
  Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs. 122-128
  Electronic Edition (link) BibTeX
• Daphne Der-Fen Liu, Xuding Zhu:
  Fractional chromatic number and circular chromatic number for distance graphs with large clique size. 129-146
  Electronic Edition (link) BibTeX
• Xingxing Yu:
  Infinite paths in planar graphs I: Graphs with radial nets. 147-162
  Electronic Edition (link) BibTeX

Volume 47, Number 3, November 2004

• Guillaume Fertin, André Raspaud, Bruce A. Reed:
  Star coloring of graphs. 163-182
  Electronic Edition (link) BibTeX
• Ronald J. Gould, Tomasz Luczak, Florian Pfender:
  Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. 183-202
  Electronic Edition (link) BibTeX
• Peter Keevash, Benny Sudakov:
  Packing triangles in a graph and its complement. 203-216
  Electronic Edition (link) BibTeX
• S. Louis Hakimi, Edward F. Schmeichel:
  Improved bounds for the chromatic number of a graph. 217-225
  Electronic Edition (link) BibTeX
• Hamed Hatami, Ruzbeh Tusserkani:
  On the complexity of the circular chromatic number. 226-230
  Electronic Edition (link) BibTeX
• Xu Xiaodong, Xie Zheng, Stanislaw P. Radziszowski:
  A constructive approach for the lower bounds on the Ramsey numbers R (s, t). 231-239
  Electronic Edition (link) BibTeX

Volume 47, Number 4, December 2004

• Liang Sun, Xingxing Yu:
  Positively curved cubic plane graphs are finite. 241-274
  Electronic Edition (link) BibTeX
• Isolde Adler:
  Marshals, monotone marshals, and hypertree-width. 275-296
  Electronic Edition (link) BibTeX
• Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster:
  Dense graphs are antimagic. 297-309
  Electronic Edition (link) BibTeX
• Andrzej Kisielewicz, Wojciech Peisert:
  Pseudo-random properties of self-complementary symmetric graphs. 310-316
  Electronic Edition (link) BibTeX
• Yaming Yu:
  Forbidden minors for wye-delta-wye reducibility. 317-321
  Electronic Edition (link) BibTeX