Tutte cycles in circuit graphs

DOI10.1016/S0012-365X(97)00154-4zbMath0893.05008OpenAlexW2069798056MaRDI QIDQ1379828

Xingxing Yu, Zhi-Cheng Gao

Publication date: 11 August 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00154-4

zbMATH Keywords

planar graphlongest cyclescircuit graphsTutte cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Longest cycles in 3-connected planar graphs
• 4-connected projective planar graphs are Hamiltonian
• Convex programming and circumference of 3-connected graphs of low genus
• Simple paths on polyhedra
• A Theorem on Planar Graphs
• A theorem on paths in planar graphs

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