Longest cycles in 3-connected graphs contain three contractible edges
From MaRDI portal
Publication:3815326
DOI10.1002/jgt.3190130105zbMath0664.05031OpenAlexW2057927603MaRDI QIDQ3815326
Nathaniel Dean, Katsuhiro Ota, R. L. Hemminger
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130105
Related Items (11)
Contractible edges in longest cycles in non-Hamiltonian graphs ⋮ On the structure of contractible edges in \(k\)-connected partial \(k\)-trees ⋮ Minimal locally cyclic triangulations of the projective plane ⋮ The 3‐connected graphs with a maximum matching containing precisely one contractible edge ⋮ A longest cycle version of Tutte's wheels theorem ⋮ On contractible and vertically contractible elements in 3-connected matroids and graphs ⋮ Contractible edges in longest cycles ⋮ Contractible edges and longest cycles in 3-connected graphs ⋮ Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge ⋮ Contractible edges and removable edges in 3-connected graphs ⋮ Unnamed Item
Cites Work
This page was built for publication: Longest cycles in 3-connected graphs contain three contractible edges
