Open AccessOn Hamiltonian cycles in claw-free cubic graphs
Author(s) -
M. Selezneva Elena,
Rautenbach Dieter
Publication year - 2019
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2249
Subject(s) - claw , mathematics , cubic graph , combinatorics , hamiltonian (control theory) , hamiltonian path , discrete mathematics , graph , line graph , mathematical optimization , voltage graph , mechanical engineering , engineering
We show that every claw-free cubic graph of order n at least 8 has at most 2⌊ n 4 ⌋ Hamiltonian cycles, and we also characterize all extremal graphs.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom