Spanning eulerian subgraphs of bounded degree in triangulations

Zhicheng Gao, Nicholas C. Wormald

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)

Abstract

We show that every triangulation of a disk or an annulus has a spanning Eulerian subgraph with maximum degree eight. Since every triangulation in the projective plane, the torus and the Klein bottle has a spanning subgraph which triangulates an annulus, this implies that all triangulations in the projective plane, the torus and the Klein bottle have spanning Eulerian subgraphs with maximum degree at most eight.

Original languageEnglish
Pages (from-to)123-131
Number of pages9
JournalGraphs and Combinatorics
Volume10
Issue number2
DOIs
Publication statusPublished - 1994
Externally publishedYes

Cite this