Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs

Abstract

A graph is called claw-free if it contains no induced subgraph isomorphic to K 1,3

Induced nets and Hamiltonicity of claw-free graphs

“…The only partial solution to Conjecture 1 that is known to the authors of this study is a theorem by Čada et al [4], which states that Conjecture 1 is true if the degree condition is strengthened to n+5 3 . In this article, we prove Conjecture 1.…”