


default search action
Journal of Graph Theory, Volume 27
Volume 27, Number 1, January 1998
- Yanjun Li, Mao-cheng Cai:
A degree condition for a graph to have [a, b]-factors. 1-6 - Atsushi Kaneko:
On decomposition of triangle-free graphs under degree constraints. 7-9 - J. Adrian Bondy, Andrew Vince:
Cycles in a graph whose lengths differ by one or two. 11-15 - Dan Archdeacon, Jozef Sirán:
Characterizing planarity using theta graphs. 17-20 - Cai Heng Li, Cheryl E. Praeger, Ming Yao Xu:
On finite groups with the cayley isomorphism property. 21-31 - Guogang Gao, Yiju Wang, Huishan Zhou:
Star chromatic numbers of some planar graphs. 33-42 - Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
Brooks-type theorems for choosability with separation. 43-49 - Petr Hlineý:
K4, 4 - e has no finite planar cover. 51-60
Volume 27, Number 2, February 1998
- Miroslav Petrovic, Bojana Milekic:
On the second largest eigenvalue of line graphs. 61-66 - Liming Xiong:
On subpancyclic line graphs. 67-74 - Waclaw Frydrych, Zdzislaw Skupien:
Non-traceability of large connected claw-free graphs. 75-86 - Sylvain Gravier, Frédéric Maffray:
Graphs whose choice number is equal to their chromatic number. 87-97 - Norbert Polat:
Graphs without isometric rays and invariant subgraph properties, I. 99-109
Volume 27, Number 3, March 1998
- Elizabeth D. Boyer:
Rank and biclique partitions of the complement of paths. 111-122 - Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
From regular boundary graphs to antipodal distance-regular graphs. 123-140 - Stephan Brandt, Ralph J. Faudree, Wayne Goddard:
Weakly pancyclic graphs. 141-176
Volume 27, Number 4, April 1998
- Bruce A. Reed:
ω, Δ, and χ. 177-212 - Steffen Enni:
A note on mixed graphs and directed splitting off. 213-221 - André Kündgen:
Covering cliques with spanning bicliques. 223-227

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.