default search action
Journal of Graph Theory, Volume 38
Volume 38, Number 1, September 2001
- Peter Dankelmann, Wayne Goddard, Peter J. Slater:
Average distance in colored graphs. 1-17 - Zhicheng Gao, Ian M. Wanless, Nicholas C. Wormald:
Counting 5-connected planar triangulations. 18-35 - Orlando Lee, Yoshiko Wakabayashi:
Note on a min-max conjecture of Woodall. 36-41 - Dan Archdeacon, C. Paul Bonnington, Nathaniel Dean, Nora Hartsfield, Katherine Scott:
Obstruction sets for outer-cylindrical graphs. 42-64
Volume 38, Number 2, October 2001
- Felix Lazebnik, Andrew J. Woldar:
General properties of some families of graphs defined by systems of equations. 65-86 - Claude Tardif:
Fractional chromatic numbers of cones over graphs. 87-94 - David B. Surowski:
Stability of arc-transitive graphs. 95-110 - András Gyárfás:
Transitive tournaments and self-complementary graphs. 111-112
Volume 38, Number 3, November 2001
- Noga Alon, Dhruv Mubayi, Robin Thomas:
Large induced forests in sparse graphs. 113-123 - William McCuaig:
Brace generation. 124-169 - Fred Galvin:
Stars and triangles. 170-176 - Andrey A. Dobrynin:
Cubic graphs without cut-vertices having the same path layer matrix. 177-182
Volume 38, Number 4, December 2001
- Luisa Gargano, Pavol Hell, Stephane Perennes:
Coloring all directed paths in a symmetric tree, with an application to optical networks. 183-196 - Hong-Jian Lai, Cun-Quan Zhang:
Hamilton weights and Petersen minors. 197-219 - Yusuke Higuchi:
Combinatorial curvature for planar graphs. 220-229 - Dan Archdeacon, C. Paul Bonnington, Jozef Sirán:
Trading crossings for handles and crosscaps. 230-243 - Richard A. Brualdi, Jian Shen:
Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments. 244-254
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.