On sufficient degree conditions for traceability of claw-free graphs

Tao Tian, Hajo Broersma, Liming Xiong

Research output: Contribution to journalArticleAcademicpeer-review

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 languageEnglish
Article number111883
JournalDiscrete mathematics
Volume343
Issue number7
DOIs
Publication statusPublished - Jul 2020

Keywords

  • Claw-free graph
  • Traceable graph
  • Line graph
  • Spanning trail
  • Closure

Fingerprint Dive into the research topics of 'On sufficient degree conditions for traceability of claw-free graphs'. Together they form a unique fingerprint.

Cite this