2-Walks in circuit graphs

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. This strengthens Barnette’s Theorem that every 3-connected planar graph has a spanning tree with maximum degree at most 3. The result also holds for 3-connected projective planar graphs. © 1994 by Academic Press, Inc.