2-WALKS IN-CIRCUIT GRAPHS

Authors
GAO ZC RICHTER RB
Citation
Zc. Gao et Rb. Richter, 2-WALKS IN-CIRCUIT GRAPHS, J COMB TH B, 62(2), 1994, pp. 259-267
Citations number
7
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN journal
00958956 → ACNP
Volume
62
Issue
2
Year of publication
1994
Pages
259 - 267
Database
ISI
SICI code
0095-8956(1994)62:2<259:2IG>2.0.ZU;2-M
Abstract
We prove the conjecture of Jackson and Wormald that every 3-connected planar graph has a closed walk visiting every vertex once or twice. Th is strengthens Barnette's Theorem that every 3-connected planar graph has a spanning tree with maximum degree at most 3. The result also hol ds for 3-connected projective planar graphs. (C) 1994 Academic Press, Inc.