English

Spanning closed walks with bounded maximum degrees of graphs on surfaces

Combinatorics 2017-12-19 v2

Abstract

Gao and Richter (1994) showed that every 33-connected graph which embeds on the plane or the projective plane has a spanning closed walk meeting each vertex at most 22 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 33-connected graph embeddable on a surface with Euler characteristic χ46\chi \le -46 admits a spanning closed walk meeting each vertex at most 62χ3\lceil \frac{6-2\chi}{3}\rceil times. In this paper, we develop these results to the remaining surfaces with Euler characteristic χ0\chi \le 0.

Keywords

Cite

@article{arxiv.1712.00125,
  title  = {Spanning closed walks with bounded maximum degrees of graphs on surfaces},
  author = {Morteza Hasanvand},
  journal= {arXiv preprint arXiv:1712.00125},
  year   = {2017}
}
R2 v1 2026-06-22T23:03:11.703Z