Abstract
We present new results on the traceability of claw-free graphs. In particular, we consider sufficient minimum degree and degree sum conditions that imply that these graphs admit a Hamilton path, unless they have a small order or they belong to well-defined classes of exceptional graphs.
Original language | English |
---|---|
Article number | 111883 |
Journal | Discrete mathematics |
Volume | 343 |
Issue number | 7 |
DOIs | |
Publication status | Published - Jul 2020 |
Keywords
- Claw-free graph
- Traceable graph
- Line graph
- Spanning trail
- Closure