default search action
Journal of Graph Theory, Volume 45
Volume 45, Number 1, January 2004
- Steve Wilson:
Semi-transitive graphs. 1-27 - Garth Isaak, Darren A. Narayan:
Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set. 28-47 - Ken-ichi Kawarabayashi:
K-linked graphs with girth condition. 48-50 - Douglas R. Woodall:
Defective choosability of graphs with no edge-plus-independent-set minor. 51-56 - Alexander K. Kelmans, Dhruv Mubayi:
How many disjoint 2-edge paths must a cubic graph have? 57-79
Volume 45, Number 2, February 2004
- Changiz Eslahchi, Matthew Johnson:
Characterization of graphs with hall number 2. 81-100 - Yan-Quan Feng, Jin Ho Kwak:
s-Regular cubic graphs as coverings of the complete bipartite graph K3, 3. 101-112 - Stefan Grünewald, Eckhard Steffen:
Independent sets and 2-factors in edge-chromatic-critical graphs. 113-118 - Douglas Bauer, T. Niessen, Edward F. Schmeichel:
Toughness, minimum degree, and spanning cubic subgraphs. 119-141 - Denis Hanson, John W. Moon:
Weakening arcs in tournaments. 142-162
Volume 45, Number 3, March 2004
- Joseph G. Conlon:
Even cycles in graphs. 163-223 - Bernhard Krön:
Growth of Self-Similar Graphs. 224-239
Volume 45, Number 4, April 2004
- Tom Bohman, David Kravitz:
On the irregularity strength of trees. 241-254 - Fedor V. Fomin, Martín Matamala, Ivan Rapaport:
Complexity of approximating the oriented diameter of chordal graphs. 255-269 - 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 - Carsten Thomassen:
Tutte's spring theorem. 275-280 - Jianji Su:
Proof of Mader's conjecture on k-critical n-connected graphs. 281-297 - Mark N. Ellingham, Xiaoya Zha, Yi Zhang:
Spanning 2-trails from degree sum conditions. 298-319
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.