On longest cycles in essentially 4-connected planar graphs

DOI10.1016/j.endm.2016.10.036zbMath1356.05036OpenAlexW2963041596MaRDI QIDQ5892303

Igor Fabrici, Jochen Harant, Stanlislav Jendroľ

Publication date: 14 February 2017

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

Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00046459/2083-5892_36_2016_3_565-575.pdf

zbMATH Keywords

planar graphlongest cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Connectivity (05C40)

Related Items (1)

On longest cycles in essentially 4-connected planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Longest cycles in 3-connected planar graphs
• Pairs of edge-disjoint Hamiltonian circuits
• Long cycles in 3-connected graphs
• Simple paths on polyhedra
• A Theorem on Planar Graphs
• Longest cycles and their chords
• On longest cycles in essentially 4-connected planar graphs
• A theorem on paths in planar graphs

This page was built for publication: On longest cycles in essentially 4-connected planar graphs