Spanning closed walks with bounded maximum degrees of graphs on surfaces
Combinatorics
2017-12-19 v2
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 .
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}
}