On the number of longest and almost longest cycles in cubic graphs.

MaRDI QIDQ4909702zbMATH OpenFDO

Authors Carsten Thomassen, Gek L. Chia

Publication date 21 March 2013

zbMATH Keywords

generalized Petersen graphcubic graphnumber of longest cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 1185588
• On 2-factors with long cycles in cubic graphs
• Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
• The number of cycles in 2-factors of cubic graphs
• Cubic graphs with no short cycle covers

Cited in

(10)

• Regular graphs in which every pair of points is missed by some longest cycle
• Length of cycles in generalized Petersen graphs
• scientific article; zbMATH DE number 1185588 (Why is no real title available?)
• Regular graphs with few longest cycles
• On Hamiltonian cycles in claw-free cubic graphs
• On 2-factors with long cycles in cubic graphs
• Graphs with few Hamiltonian cycles
• Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
• Triangle-free graphs with the maximum number of cycles
• Highly-connected planar cubic graphs with few or many Hamilton cycles

This page was built for publication: On the number of longest and almost longest cycles in cubic graphs.

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