On Hamiltonian cycles in claw-free cubic graphs

DOI10.7151/DMGT.2249MaRDI QIDQ2062689zbMATH OpenOpenAlexWikidataFDO

Authors Elena Mohr, Dieter Rautenbach

Publication date 3 January 2022

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2249

zbMATH Keywords

claw-free graphcubic graphHamiltonian cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Review text

The authors show that every claw-free cubic graph of order \(n\) at least 8 has at most \(2^{\lfloor n/4 \rfloor}\) Hamiltonian cycles, and characterize all extremal graphs which are structurally similar.

Recommendations

• Hamiltonian cycles in 3‐connected claw‐free graphs
• Hamiltonian cycles in regular 3-connected claw-free graphs
• Hamilton cycles in cubic graphs
• scientific article; zbMATH DE number 883275
• Hamilton cycles in claw-free graphs

Cites work

• On the number of longest and almost longest cycles in cubic graphs.
• Recounting Fibonacci and Lucas Identities

Cited in

(8)

• Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers
• The asymptotic number of claw-free cubic graphs.
• Cycle traversability for claw-free graphs and polyhedral maps
• scientific article; zbMATH DE number 5914958 (Why is no real title available?)
• Hamiltonian cycles in 3‐connected claw‐free graphs
• On the number of cycles in a graph
• scientific article; zbMATH DE number 883275 (Why is no real title available?)
• Hamilton cycles in cubic graphs

This page was built for publication: On Hamiltonian cycles in claw-free cubic graphs

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