On longest cycles in essentially 4-connected planar graphs

DOI10.7151/dmgt.1875zbMath1339.05073OpenAlexW2334582030MaRDI QIDQ5895079

Igor Fabrici, Jochen Harant, Stanlislav Jendroľ

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1875

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 (4)

Computing Tutte Paths ⋮ Longer cycles in essentially 4-connected planar graphs ⋮ On the Circumference of Essentially 4-connected Planar Graphs ⋮ Circumference of essentially 4-connected planar triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Longest cycles in 3-connected planar graphs
• Pairs of edge-disjoint Hamiltonian circuits
• A Theorem on Planar Graphs
• Paths of low weight in planar graphs
• Longest cycles and their chords
• A theorem on paths in planar graphs

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