On the set of cycle lengths in a Hamiltonian graph with a given maximum degree

DOI10.1007/S00373-004-0580-1MaRDI QIDQ704854zbMATH OpenOpenAlexFDO

Authors Antoni Marczyk

Publication date 20 January 2005

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

Full work available at URL https://doi.org/10.1007/s00373-004-0580-1

zbMATH Keywords

CyclesHamiltonian graphsPancyclic graphs

Mathematics Subject Classification ID

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

Recommendations

• On pancyclism of Hamiltonian graphs
• Cycles in Hamiltonian graphs of prescribed maximum degree
• Another cycle structure theorem for Hamiltonian graphs
• On pancyclism in Hamiltonian graphs
• On the structure of the set of cycle lengths in a Hamiltonian graph

Cited in

(8)

• On pancyclism in Hamiltonian graphs
• Cycles in Hamiltonian graphs of prescribed maximum degree
• On the structure of the set of cycle lengths in a Hamiltonian graph
• On pancyclism of Hamiltonian graphs
• On the stability for pancyclicity
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
• The cycle spectrum of claw-free Hamiltonian graphs
• Cycle lengths of Hamiltonian \(P_\ell\)-free graphs

This page was built for publication: On the set of cycle lengths in a Hamiltonian graph with a given maximum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704854)