Journal of Graph Theory, Volume 60

Volume 60, Number 1, January 2009

• Hal A. Kierstead, André Kündgen, Craig Timmons:
  Star coloring bipartite planar graphs. 1-10
  Electronic Edition (link) BibTeX
• László Lovász, Balázs Szegedy:
  Contractors and connectors of graph algebras. 11-30
  Electronic Edition (link) BibTeX
• Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl:
  Average distance and maximum induced forest. 31-54
  Electronic Edition (link) BibTeX
• Michael A. Henning, Anders Yeo:
  Total domination in 2-connected graphs and in graphs with no induced 6-cycles. 55-79
  Electronic Edition (link) BibTeX
• Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu:
  M-degrees of quadrangle-free planar graphs. 80-85
  Electronic Edition (link) BibTeX

Volume 60, Number 2, February 2009

• Ch. Sobhan Babu, Ajit A. Diwan:
  Disjoint cycles with chords in graphs. 87-98
  Electronic Edition (link) BibTeX
• Kiyoshi Ando:
  A local structure theorem on 5-connected graphs. 99-129
  Electronic Edition (link) BibTeX
• Dirk Meierling:
  Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments. 130-148
  Electronic Edition (link) BibTeX
• Rong Luo, Lianying Miao, Yue Zhao:
  The size of edge chromatic critical graphs with maximum degree 6. 149-171
  Electronic Edition (link) BibTeX

Volume 60, Number 3, March 2009

• Daniel W. Cranston:
  Regular bipartite graphs are antimagic. 173-182
  Electronic Edition (link) BibTeX
• Sang-il Oum:
  Excluding a bipartite circle graph from line graphs. 183-203
  Electronic Edition (link) BibTeX
• Anthony Bonato, Jeannette Janssen, Changping Wang:
  The n-ordered graphs: A new graph class. 204-218
  Electronic Edition (link) BibTeX
• Peter Allen:
  Forbidden induced bipartite graphs. 219-241
  Electronic Edition (link) BibTeX
• Tomasz Bartnicki, Jaroslaw Grytczuk, Stanislaw Niwczyk:
  Weight choosability of graphs. 242-256
  Electronic Edition (link) BibTeX

Volume 60, Number 4, April 2009

• Anthony J. W. Hilton:
  On the number of (r, r+1)- factors in an (r, r+1)-factorization of a simple graph. 257-268
  Electronic Edition (link) BibTeX
• Elad Horev, Roi Krakovski:
  Polychromatic colorings of bounded degree plane graphs. 269-283
  Electronic Edition (link) BibTeX
• Anja Pruchnewski, Margit Voigt:
  Precoloring extension for K₄-minor-free graphs. 284-294
  Electronic Edition (link) BibTeX
• Cheng Yeaw Ku, Benjamin B. McMillan:
  Independent sets of maximal size in tensor powers of vertex-transitive graphs. 295-301
  Electronic Edition (link) BibTeX
• Raiji Mukae, Atsuhiro Nakamoto:
  K₆-minors in triangulations and complete quadrangulations. 302-312
  Electronic Edition (link) BibTeX
• Carolyn Chun, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan:
  Unavoidable parallel minors of 4-connected graphs. 313-326
  Electronic Edition (link) BibTeX
• Qi Liu, Douglas B. West, Gexin Yu:
  Implications among linkage properties in graphs. 327-337
  Electronic Edition (link) BibTeX