On the Circumference of Essentially 4-connected Planar Graphs

DOI10.7155/jgaa.00516zbMath1433.05085arXiv1806.09413OpenAlexW3003881300MaRDI QIDQ5208868

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

Publication date: 22 January 2020

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

planar graphslongest cyclegraph circumferenceessentially 4-connected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Connectivity (05C40)

Related Items (1)

Circumference of essentially 4-connected planar triangulations

Cites Work

• Longest cycles in 3-connected planar graphs
• Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
• Polyhedra of small order and their Hamiltonian properties
• Longer cycles in essentially 4-connected planar graphs
• Longest cycles and their chords
• Congruent Graphs and the Connectivity of Graphs
• Computing Tutte Paths
• On longest cycles in essentially 4-connected planar graphs

This page was built for publication: On the Circumference of Essentially 4-connected Planar Graphs