Spanning Eulerian subgraphs of bounded degree in triangulations

DOI10.1007/BF02986656zbMath0804.05026MaRDI QIDQ1334938

Nicholas C. Wormald, Zhi-Cheng Gao

Publication date: 26 September 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

triangulationtorusprojective planeKlein bottlespanning Eulerian subgraph\(k\)-trail

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Unnamed Item ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Bridges and Hamiltonian circuits in planar graphs
• Trees in triangulations
• 4-connected projective planar graphs are Hamiltonian
• Spanning trees in locally planar triangulations
• 2-walks in circuit graphs
• Five-connected toroidal graphs are Hamiltonian
• Spanning planar subgraphs of graphs in the torus and Klein bottle
• A Theorem on Planar Graphs
• Hamiltonicity of 5‐Connected Toroidal Triangulations
• Computing the orientable genus of projective graphs
• Trees in Polyhedral Graphs
• A theorem on paths in planar graphs

This page was built for publication: Spanning Eulerian subgraphs of bounded degree in triangulations