On 2-walks in chordal planar graphs

DOI10.1016/j.disc.2008.11.027zbMath1207.05116OpenAlexW2029156511MaRDI QIDQ1043570

Jakub Teska

Publication date: 9 December 2009

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

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

zbMATH Keywords

chordal graphHamiltonicityplanar graphtoughness2-walk

Mathematics Subject Classification ID

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

Cites Work

• On rigid circuit graphs
• Tough graphs and Hamiltonian circuits.
• More than one tough chordal planar graphs are Hamiltonian
• Toughness, trees, and walks
• Unnamed Item
• Unnamed Item
• Unnamed Item