Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
From MaRDI portal
Publication:1865159
DOI10.1007/S003730200033zbMath1009.05090OpenAlexW2035136476MaRDI QIDQ1865159
Publication date: 25 March 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200033
Related Items (3)
On the structure of contractible edges in \(k\)-connected partial \(k\)-trees ⋮ Contractible edges and longest cycles in 3-connected graphs ⋮ Contractible edges and removable edges in 3-connected graphs
This page was built for publication: Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
