Contractible edges in longest cycles in non-Hamiltonian graphs

DOI10.1016/0012-365X(94)90018-3zbMath0814.05050MaRDI QIDQ1336689

R. L. Hemminger, Kathryn E. Johnson, Mark N. Ellingham

Publication date: 3 November 1994

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

zbMATH Keywords

longest cyclesnon-Hamiltoniancontractible edges

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (5)

On the structure of contractible edges in \(k\)-connected partial \(k\)-trees ⋮ A longest cycle version of Tutte's wheels theorem ⋮ Contractible edges in longest cycles ⋮ Contractible edges and longest cycles in 3-connected graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractible edges in 3-connected graphs
• The number of contractible edges in 3-connected graphs
• Zur Theorie der n-fach zusammenhängenden Graphen
• Longest cycles in 3-connected graphs contain three contractible edges
• The 3‐connected graphs having a longest cycle containing only three contractible edges

This page was built for publication: Contractible edges in longest cycles in non-Hamiltonian graphs