On longest cycles in essentially 4-connected planar graphs

DOI10.7151/DMGT.1875MaRDI QIDQ5895079zbMATH OpenOpenAlexFDO

Authors Igor Fabrici, Jochen Harant, Stanislav Jendroľ

Publication date 13 July 2016

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

longest cycleplanar graph

Mathematics Subject Classification ID

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

Recommendations

• On longest cycles in essentially 4-connected planar graphs
• Longer cycles in essentially 4-connected planar graphs
• On the circumference of essentially 4-connected planar graphs
• Cycles in 4-connected planar graphs
• Circumference of essentially 4-connected planar triangulations

Cites work

• scientific article; zbMATH DE number 1002024 (Why is no real title available?)
• A Theorem on Planar Graphs
• A theorem on paths in planar graphs
• Graph theory
• Longest cycles and their chords
• Longest cycles in 3-connected planar graphs
• Pairs of edge-disjoint Hamiltonian circuits
• Paths of low weight in planar graphs

Cited in

(9)

• Computing Tutte paths
• Dynamics of cycles in polyhedra. I: The isolation lemma
• Long cycles in 4-connected planar graphs
• On the circumference of essentially 4-connected planar graphs
• On longest cycles in essentially 4-connected planar graphs
• Longest cycles in cyclically 4-edge-connected cubic planar graphs
• On the structure of essentially-highly-connected polyhedral graphs
• Longer cycles in essentially 4-connected planar graphs
• Circumference of essentially 4-connected planar triangulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895079)