Journal of Graph Theory, Volume 50

Volume 50, Number 1, September 2005

• Michael D. Plummer, Akira Saito:
  Forbidden subgraphs and bounds on the size of a maximum matching. 1-12
  Electronic Edition (link) BibTeX
• Dragan Marusic, Joy Morris:
  Normal cirulant graphs with noncyclic regular subroups. 13-24
  Electronic Edition (link) BibTeX
• Marston Conder, Aleksander Malnic, Dragan Marusic, Tomaz Pisanski, Primoz Potocnik:
  The edge-transitive but not vertex-transitive cubic graph on 112 vertices. 25-42
  Electronic Edition (link) BibTeX
• Bernard Montaron:
  An improvement of the crossing number bound. 43-54
  Electronic Edition (link) BibTeX
• Heinz Adolf Jung, Elkin Vumar:
  Degree bounds for the circumference of 3-connected graphs. 55-78
  Electronic Edition (link) BibTeX
• Jinlong Shu, Cun-Quan Zhang:
  Nowhere-zero 3-flows in products of graphs. 79-89
  Electronic Edition (link) BibTeX

Volume 50, Number 2, October 2005

• Danhong Zhang, Hong Wang:
  Disjoint directed quadrilaterals in a directed graph. 91-104
  Electronic Edition (link) BibTeX
• Jin Ho Kwak, Young Soo Kwon:
  Regular orientable embeddings of complete bipartite graphs. 105-122
  Electronic Edition (link) BibTeX
• Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss:
  A note on group colorings. 123-129
  Electronic Edition (link) BibTeX
• Zhiquan Hu, Feng Tian, Bing Wei:
  Hamilton connectivity of line graphs and claw-free graphs. 130-141
  Electronic Edition (link) BibTeX
• Paul Baginski:
  A generalization of a Ramsey-type theorem on hypermatchings. 142-149
  Electronic Edition (link) BibTeX
• Henning Bruhn, Reinhard Diestel, Maya Stein:
  Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. 150-161
  Electronic Edition (link) BibTeX
• Shaun M. Fallat, Stephen J. Kirkland, Jason J. Molitierno, M. Neumann:
  On graphs whose Laplacian matrices have distinct integer eigenvalues. 162-174
  Electronic Edition (link) BibTeX

Volume 50, Number 3, November 2005

• Lingsheng Shi:
  Linear Ramsey numbers of sparse graphs. 175-185
  Electronic Edition (link) BibTeX
• Sandi Klavzar, Bojan Mohar:
  Crossing numbers of Sierpinski-like graphs. 186-198
  Electronic Edition (link) BibTeX
• Henning Bruhn, Reinhard Diestel, Maya Stein:
  Menger's theorem for infinite graphs with ends. 199-211
  Electronic Edition (link) BibTeX
• Anders Yeo:
  The number of pancyclic arcs in a k-strong tournament. 212-219
  Electronic Edition (link) BibTeX
• Yared Nigussie, Neil Robertson:
  On structural descriptions of lower ideals of trees. 220-233
  Electronic Edition (link) BibTeX
• R. Bruce Richter, Gelasio Salazar:
  Two maps with large representativity on one surface. 234-245
  Electronic Edition (link) BibTeX
• Luis A. Goddyn, Ladislav Stacho:
  Edge disjoint cycles through specified vertices. 246-260
  Electronic Edition (link) BibTeX
• Alastair Farrugia, Peter Mihók, R. Bruce Richter, Gabriel Semanisin:
  Erratum to: Factorizations and characterizations of induced-hereditary and compositive properties. 261
  Electronic Edition (link) BibTeX

Volume 50, Number 4, December 2005

• Dan Hefetz:
  Anti-magic graphs via the Combinatorial NullStellenSatz. 263-272
  Electronic Edition (link) BibTeX
• Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West:
  Nordhaus-Gaddum-type Theorems for decompositions into many parts. 273-292
  Electronic Edition (link) BibTeX
• Ya-Chen Chen, Zoltán Füredi:
  Minimum vertex-diameter-2-critical graphs. 293-315
  Electronic Edition (link) BibTeX
• Yang Yuansheng, Zhao Chengye, Lin Xiaohui, Jiang Yongsong, Hao Xin:
  Some 3-connected 4-edge-critical non-Hamiltonian graphs. 316-320
  Electronic Edition (link) BibTeX
• Alexandr V. Kostochka, Gexin Yu:
  An extremal problem for H-linked graphs. 321-339
  Electronic Edition (link) BibTeX