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

zbMATH Open1274.05254MaRDI QIDQ4909702FDOQ4909702

Authors: Carsten Thomassen, Gek L. Chia 

Publication date: 21 March 2013

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

zbMATH Keywords

generalized Petersen graphcubic graphnumber of longest cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (8)

• On 2-factors with long cycles in cubic graphs
• Highly-connected planar cubic graphs with few or many Hamilton cycles
• Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
• Triangle-free graphs with the maximum number of cycles
• Regular Graphs with Few Longest Cycles
• On Hamiltonian cycles in claw-free cubic graphs
• Regular graphs in which every pair of points is missed by some longest cycle
• Graphs with few hamiltonian 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)