Hamiltonicity of 5‐Connected Toroidal Triangulations

DOI10.1002/jgt.3190200303zbMath0841.05061OpenAlexW1984734473MaRDI QIDQ4857424

Richard Brunet, R. Bruce Richter

Publication date: 14 July 1996

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200303

zbMATH Keywords

Hamiltonian graphHamiltonian cycletoroidal graphtoroidal triangulation

Mathematics Subject Classification ID

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

Related Items (9)

Spanning Eulerian subgraphs of bounded degree in triangulations ⋮ Counting Hamiltonian cycles in planar triangulations ⋮ Hamiltonian cycles in polyhedral maps ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Hamilton paths in toroidal graphs ⋮ Unnamed Item ⋮ A note on traversing specified vertices in graphs embedded with large representativity ⋮ Criticality of counterexamples to toroidal edge-Hamiltonicity ⋮ On Hamiltonian cycles in 4- and 5-connected plane triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonicity of 5‐Connected Toroidal Triangulations