Spanning closed walks with bounded maximum degrees of graphs on surfaces

Abstract

Gao and Richter (1994) showed that every 3-connected graph which embeds on the plane or the projective plane has a spanning closed walk meeting each vertex at most 2 times. Brunet, Ellingham, Gao, Metzlar, and Richter (1995) extended this result to the torus and Klein bottle. Sanders and Zhao (2001) obtained a sharp result for higher surfaces by proving that every 3-connected graph embeddable on a surface with Euler characteristic -46 admits a spanning closed walk meeting each vertex at most 6-23 times. In this paper, we develop these results to the remaining surfaces with Euler characteristic 0.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…