Circumference of essentially 4-connected planar triangulations

DOI10.7155/jgaa.00552zbMath1457.05108arXiv2101.03802OpenAlexW3118324241MaRDI QIDQ5856664

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

Publication date: 29 March 2021

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

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

zbMATH Keywords

triangulationcircumferenceplanar graphlong cycleessentially 4-connected

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Tutte paths and long cycles in circuit graphs

Cites Work

• Longest cycles in 3-connected planar graphs
• Longest cycles in 3-connected cubic graphs
• Pairs of edge-disjoint Hamiltonian circuits
• On a closure concept in claw-free graphs
• On some intriguing problems in Hamiltonian graph theory---a survey
• Regular non-Hamiltonian polyhedral graphs
• Cubic Graphs with Large Circumference Deficit
• A non-Hamiltonian planar graph
• Longest paths and cycles in K1,3-free graphs
• Longest cycles and their chords
• Reflections on graph theory
• Nonhamiltonian 3-Connected Cubic Planar Graphs
• On the Circumference of Essentially 4-connected Planar Graphs
• Hamiltonian circuits on 3-polytopes
• On longest cycles in essentially 4-connected planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Circumference of essentially 4-connected planar triangulations