Journal of Graph Theory, Volume 45

Volume 45, Number 1, January 2004

• Steve Wilson:
  Semi-transitive graphs. 1-27
  Electronic Edition (link) BibTeX
• Garth Isaak, Darren A. Narayan:
  Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set. 28-47
  Electronic Edition (link) BibTeX
• Ken-ichi Kawarabayashi:
  K-linked graphs with girth condition. 48-50
  Electronic Edition (link) BibTeX
• Douglas R. Woodall:
  Defective choosability of graphs with no edge-plus-independent-set minor. 51-56
  Electronic Edition (link) BibTeX
• Alexander K. Kelmans, Dhruv Mubayi:
  How many disjoint 2-edge paths must a cubic graph have? 57-79
  Electronic Edition (link) BibTeX

Volume 45, Number 2, February 2004

• Changiz Eslahchi, Matthew Johnson:
  Characterization of graphs with hall number 2. 81-100
  Electronic Edition (link) BibTeX
• Yan-Quan Feng, Jin Ho Kwak:
  s-Regular cubic graphs as coverings of the complete bipartite graph K_{3, 3}. 101-112
  Electronic Edition (link) BibTeX
• Stefan Grünewald, Eckhard Steffen:
  Independent sets and 2-factors in edge-chromatic-critical graphs. 113-118
  Electronic Edition (link) BibTeX
• Douglas Bauer, T. Niessen, Edward F. Schmeichel:
  Toughness, minimum degree, and spanning cubic subgraphs. 119-141
  Electronic Edition (link) BibTeX
• Denis Hanson, John W. Moon:
  Weakening arcs in tournaments. 142-162
  Electronic Edition (link) BibTeX

Volume 45, Number 3, March 2004

• Joseph G. Conlon:
  Even cycles in graphs. 163-223
  Electronic Edition (link) BibTeX
• B. Krön:
  Growth of Self-Similar Graphs. 224-239
  Electronic Edition (link) BibTeX

Volume 45, Number 4, April 2004

• Tom Bohman, David Kravitz:
  On the irregularity strength of trees. 241-254
  Electronic Edition (link) BibTeX
• Fedor V. Fomin, Martín Matamala, Ivan Rapaport:
  Complexity of approximating the oriented diameter of chordal graphs. 255-269
  Electronic Edition (link) BibTeX
• Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz:
  Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. 270-274
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Tutte's spring theorem. 275-280
  Electronic Edition (link) BibTeX
• Su Jianji:
  Proof of Mader's conjecture on k-critical n-connected graphs. 281-297
  Electronic Edition (link) BibTeX
• Mark N. Ellingham, Xiaoya Zha, Yi Zhang:
  Spanning 2-trails from degree sum conditions. 298-319
  Electronic Edition (link) BibTeX