Journal of Graph Theory, Volume 55

Volume 55, Number 1, May 2007

• Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott:
  Maximum directed cuts in acyclic digraphs. 1-13
  Electronic Edition (link) BibTeX
• Chin-Ann Soh:
  The circular chromatic numbers of planar digraphs. 14-26
  Electronic Edition (link) BibTeX
• David Coudert, Florian Huc, Jean-Sébastien Sereni:
  Pathwidth of outerplanar graphs. 27-41
  Electronic Edition (link) BibTeX
• Fedor V. Fomin, Dimitrios M. Thilikos:
  On self duality of pathwidth in polyhedral graph embeddings. 42-54
  Electronic Edition (link) BibTeX
• Stefko Miklavic, Primoz Potocnik, Steve Wilson:
  Overlap in consistent cycles. 55-71
  Electronic Edition (link) BibTeX
• Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang:
  The upper bound of the number of cycles in a 2-factor of a line graph. 72-82
  Electronic Edition (link) BibTeX
• Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki:
  Spanning trees with leaf distance at least four. 83-90
  Electronic Edition (link) BibTeX

Volume 55, Number 2, June 2007

• Weiting Cao, Peter Hamburger:
  Solution of fink & straight conjecture on path-perfect complete bipartite graphs. 91-111
  Electronic Edition (link) BibTeX
• Robert E. L. Aldred, Bill Jackson:
  Edge proximity conditions for extendability in cubic bipartite graphs. 112-120
  Electronic Edition (link) BibTeX
• Zemin Jin, Xingxing Yu, Xiaoyan Zhang:
  Contractible subgraphs in k-connected graphs. 121-136
  Electronic Edition (link) BibTeX
• Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
  Backbone colorings for graphs: Tree and path backbones. 137-152
  Electronic Edition (link) BibTeX
• Camino Balbuena, T. Jiang, Yuqing Lin, Xavier Marcote, Mirka Miller:
  A lower bound on the order of regular graphs with given girth pair. 153-163
  Electronic Edition (link) BibTeX
• András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
  Tripartite Ramsey numbers for paths. 164-174
  Electronic Edition (link) BibTeX

Volume 55, Number 3, July 2007

• T. H. Marshall:
  Homomorphism bounds for oriented planar graphs. 175-190
  Electronic Edition (link) BibTeX
• Leif K. Jørgensen, Ken-ichi Kawarabayashi:
  Extremal results for rooted minor problems. 191-207
  Electronic Edition (link) BibTeX
• Dror Fidler, Raphael Yuster:
  Remarks on the second neighborhood problem. 208-220
  Electronic Edition (link) BibTeX
• Amine El Sahili, Mekkia Kouider:
  About paths with two blocks. 221-226
  Electronic Edition (link) BibTeX
• Martín Matamala:
  Vertex partitions and maximum degenerate subgraphs. 227-232
  Electronic Edition (link) BibTeX
• Jozef Sirán, Thomas W. Tucker:
  Characterization of graphs which admit vertex-transitive embeddings. 233-248
  Electronic Edition (link) BibTeX
• André Raspaud, Xuding Zhu:
  List circular coloring of trees and cycles. 249-265
  Electronic Edition (link) BibTeX

Volume 55, Number 4, August 2007

• Zhi-Zhong Chen:
  New bounds on the edge number of a k-map graph. 267-290
  Electronic Edition (link) BibTeX
• Florent Balacheff:
  Volume entropy, weighted girths and stable balls on graphs. 291-305
  Electronic Edition (link) BibTeX
• Alexander K. Kelmans:
  Packing k-edge trees in graphs of restricted vertex degrees. 306-324
  Electronic Edition (link) BibTeX
• Anders Yeo:
  Relationships between total domination, order, size, and maximum degree of graphs. 325-337
  Electronic Edition (link) BibTeX
• Carol T. Zamfirescu, Tudor Zamfirescu:
  A planar hypohamiltonian graph with 48 vertices. 338-342
  Electronic Edition (link) BibTeX
• Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
  Tutte sets in graphs I: Maximal tutte sets and D-graphs. 343-358
  Electronic Edition (link) BibTeX