Article in volume
Authors:
Title:
On Hamiltonian cycles in claw-free cubic graphs
PDFSource:
Discussiones Mathematicae Graph Theory 42(1) (2022) 309-313
Received: 2019-04-16 , Revised: 2019-09-27 , Accepted: 2019-09-27 , Available online: 2019-11-04 , https://doi.org/10.7151/dmgt.2249
Abstract:
We show that every claw-free cubic graph of order $n$ at least $8$ has at
most $2^{\left\lfloor\frac{n}{4}\right\rfloor}$ Hamiltonian cycles, and
we also characterize all extremal graphs.
Keywords:
Hamiltonian cycle, claw-free graph, cubic graph
References:
- A.T. Benjamin and J.J. Quinn, Recounting Fibonacci and Lucas identities, College Math. J. 30 (1999) 359–366.
https://doi.org/10.1080/07468342.1999.11974086 - G.L. Chia and C. Thomassen, On the number of longest and almost longest cycles in cubic graphs, Ars Combin. 104 (2012) 307–320.
Close