Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum

DOI10.1007/S00373-010-0915-ZzbMath1230.05179OpenAlexW2057580655MaRDI QIDQ604675

Michael S. Jacobson, Angela Harris, Michael Ferrara

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0915-z

zbMATH Keywords

Hamiltonian cyclepancyclic

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Clique-heavy subgraphs and pancyclicity of 2-connected graphs ⋮ On the cycle spectrum of cubic Hamiltonian graphs ⋮ A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs ⋮ Cycle spectra of Hamiltonian graphs ⋮ A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs ⋮ A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs ⋮ Fan's condition on induced subgraphs for circumference and pancyclicity ⋮ The cycle spectrum of claw-free Hamiltonian graphs

Cites Work

• A cycle structure theorem for Hamiltonian graphs
• Pancyclic graphs. I
• Note on Hamilton Circuits

This page was built for publication: Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum