Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs

DOI10.1016/j.disc.2009.10.005zbMath1257.05078OpenAlexW1985933130MaRDI QIDQ968420

Jochen Harant, Frank Göring

Publication date: 5 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.005

zbMATH Keywords

Hamiltonian cyclemaximal planar graphprescribed edges

Mathematics Subject Classification ID

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

Related Items (3)

Rooted minors and locally spanning subgraphs ⋮ Prescribed edges and forbidden edges for a cycle in a planar graph ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On a cycle through a specified linear forest of a graph
• A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
• Bridges and Hamiltonian circuits in planar graphs
• 4-connected projective planar graphs are Hamiltonian
• On Hamiltonian cycles in 4- and 5-connected plane triangulations
• A Theorem on Planar Graphs
• On certain Hamiltonian cycles in planar graphs
• A theorem on paths in planar graphs

This page was built for publication: Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs