Spanning closed walks with bounded maximum degrees of graphs on surfaces
Morteza Hasanvand

TL;DR
This paper extends known results on spanning closed walks with bounded vertex visits in 3-connected graphs embedded on surfaces, covering all surfaces with non-positive Euler characteristic.
Contribution
It generalizes previous theorems to include all surfaces with Euler characteristic less than or equal to zero.
Findings
Extended spanning walk bounds to all surfaces with χ ≤ 0.
Unified framework for surfaces with Euler characteristic ≤ 0.
Improved understanding of graph embeddings on complex surfaces.
Abstract
Gao and Richter (1994) showed that every -connected graph which embeds on the plane or the projective plane has a spanning closed walk meeting each vertex at most 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 -connected graph embeddable on a surface with Euler characteristic admits a spanning closed walk meeting each vertex at most times. In this paper, we develop these results to the remaining surfaces with Euler characteristic .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Complexity and Algorithms in Graphs
