Tutte paths and long cycles in circuit graphs

DOI10.1016/j.jctb.2022.07.006zbMath1504.05154OpenAlexW4289745805MaRDI QIDQ2099420

Xingxing Yu, Michael C. Wigal

Publication date: 23 November 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2022.07.006

zbMATH Keywords

cyclebridgeTutte subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Longest cycles in 3-connected planar graphs
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• 4-connected projective planar graphs are Hamiltonian
• The four-colour theorem
• Long cycles in graphs on a fixed surface
• Long cycles in 3-connected graphs
• Disjoint paths, planarizing cycles, and spanning walks
• A Theorem on Planar Graphs
• On Hamiltonian Circuits
• Circumference of essentially 4-connected planar triangulations
• A theorem on paths in planar graphs

This page was built for publication: Tutte paths and long cycles in circuit graphs