On longest cycles in essentially 4-connected planar graphs

DOI10.7151/DMGT.1875zbMATH Open1339.05073OpenAlexW2334582030MaRDI QIDQ5895079FDOQ5895079

Authors: Igor Fabrici, Jochen Harant, Stanislav 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

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

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)

Cites Work

• Graph theory
• Title not available (Why is that?)
• A Theorem on Planar Graphs
• A theorem on paths in planar graphs
• Pairs of edge-disjoint Hamiltonian circuits
• Longest cycles and their chords
• Paths of low weight in planar graphs
• Longest cycles in 3-connected planar graphs

Cited In (6)

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

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)