Premium
Hamiltonian cycles in 3‐connected claw‐free graphs
Author(s) -
Li MingChu
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170305
Subject(s) - claw , mathematics , combinatorics , hamiltonian path , hamiltonian (control theory) , graph , mathematical optimization , mechanical engineering , engineering
In this paper, we show that every 3‐connected claw‐free graph on n vertices with δ ≥ ( n + 5)/5 is hamiltonian. © 1993 John Wiley & Sons, Inc.
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