Longer cycles in essentially 4-connected planar graphs

DOI10.7151/dmgt.2133zbMath1430.05061arXiv1710.05619OpenAlexW2550821847WikidataQ129542595 ScholiaQ129542595MaRDI QIDQ2282479

Jochen Harant, Igor Fabrici, Samuel Mohr, Jens M. Schmidt

Publication date: 8 January 2020

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

Full work available at URL: https://arxiv.org/abs/1710.05619

zbMATH Keywords

circumferencelongest cycleshortness coefficientessentially 4-connected planar graph

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

Computing Tutte Paths ⋮ On the Circumference of Essentially 4-connected Planar Graphs

Cites Work

• Longest cycles in 3-connected planar graphs
• Pairs of edge-disjoint Hamiltonian circuits
• Polyhedra of small order and their Hamiltonian properties
• Longest cycles and their chords
• Computing Tutte Paths
• On longest cycles in essentially 4-connected planar graphs
• Unnamed Item

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