Journal of Graph Theory, Volume 58

Volume 58, Number 1, May 2008

• Nicolas Bougard, Gwenaël Joret:
  Turán's theorem and k-connected graphs. 1-13
  Electronic Edition (link) BibTeX
• Alexandr V. Kostochka, Gexin Yu:
  Ore-type degree conditions for a graph to be H-linked. 14-26
  Electronic Edition (link) BibTeX
• Weifan Wang, Ko-Wei Lih:
  Coupled choosability of plane graphs. 27-44
  Electronic Edition (link) BibTeX
• Ehsan Chiniforooshan:
  A better bound for the cop number of general graphs. 45-48
  Electronic Edition (link) BibTeX
• Clemens Heuberger, Stephan G. Wagner:
  Maximizing the number of independent subsets over trees with bounded degree. 49-68
  Electronic Edition (link) BibTeX
• Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
  Neighborhood hypergraphs of bipartite graphs. 69-95
  Electronic Edition (link) BibTeX

Volume 58, Number 2, June 2008

• Shinya Fujita, Ken-ichi Kawarabayashi:
  Contractible elements in k-connected graphs not containing some specified graphs. 97-109
  Electronic Edition (link) BibTeX
• Manouchehr Zaker:
  New bounds for the chromatic number of graphs. 110-122
  Electronic Edition (link) BibTeX
• Maria Axenovich, André E. Kézdy, Ryan Martin:
  On the editing distance of graphs. 123-138
  Electronic Edition (link) BibTeX
• Dieter Rautenbach:
  A conjecture of Borodin and a coloring of Grünbaum. 139-147
  Electronic Edition (link) BibTeX
• Penny E. Haxell:
  An improved bound for the strong chromatic number. 148-158
  Electronic Edition (link) BibTeX
• Paul Wollan:
  Extremal functions for rooted minors. 159-178
  Electronic Edition (link) BibTeX
• Jun Fujisawa, Tomoki Yamashita:
  Cycles passing through k + 1 vertices in k-connected graphs. 179-190
  Electronic Edition (link) BibTeX

Volume 58, Number 3, July 2008

• Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
  A Characterization of the degree sequences of 2-trees. 191-209
  Electronic Edition (link) BibTeX
• Jian-Liang Wu, Yu-Wen Wu:
  The linear arboricity of planar graphs of maximum degree seven is four. 210-220
  Electronic Edition (link) BibTeX
• Zhongyuan Che, Karen L. Collins, Claude Tardif:
  Odd-angulated graphs and cancelling factors in box products. 221-238
  Electronic Edition (link) BibTeX
• David Cariolaro, Hung-Lin Fu:
  On minimum sets of 1-factors covering a complete multipartite graph. 239-250
  Electronic Edition (link) BibTeX
• Scott Heard, Jing Huang:
  Disjoint quasi-kernels in digraphs. 251-260
  Electronic Edition (link) BibTeX
• Serguei Norine:
  On two questions about circular choosability. 261-269
  Electronic Edition (link) BibTeX
• Jim Geelen, Anjie Guo, David McKinnon:
  Straight line embeddings of cubic planar graphs with integer edge lengths. 270-274
  Electronic Edition (link) BibTeX

Volume 58, Number 4, August 2008

• Thomas Andreae:
  On self-immersions of infinite graphs. 275-285
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Decompositions of highly connected graphs into paths of length 3. 286-292
  Electronic Edition (link) BibTeX
• Etienne Birmelé:
  Every longest circuit of a 3-connected, K_{3, 3}-minor free graph has a chord. 293-298
  Electronic Edition (link) BibTeX
• Bill Cuckler, Felix Lazebnik:
  Irregularity strength of dense graphs. 299-313
  Electronic Edition (link) BibTeX
• Daniel Král, Ladislav Stacho:
  Hamiltonian threshold for strong products of graphs. 314-328
  Electronic Edition (link) BibTeX
• Guantao Chen, Ralph J. Faudree, Xuechao Li, Ingo Schiermeyer:
  Non-path spectrum sets. 329-350
  Electronic Edition (link) BibTeX
• David Conlon:
  A new upper bound for the bipartite Ramsey problem. 351-356
  Electronic Edition (link) BibTeX