A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
From MaRDI portal
Publication:1044928
DOI10.1016/j.disc.2008.04.038zbMath1194.05069MaRDI QIDQ1044928
Stefan Senitsch, Jochen Harant
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.038
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
Related Items
Computing Tutte Paths, Unnamed Item, Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs, Cycles through all finite vertex sets in infinite graphs, Prescribed edges and forbidden edges for a cycle in a planar graph
Cites Work