Induced nets and Hamiltonicity of claw-free graphs (Q2045363): Difference between revisions

The connected graph of the degree sequence 3, 3, 3, 1, 1, 1 is called a net, and the vertices of degree 1 in a net are called its endvertices. The authors prove that a 2-connected graph \(G\) of \(n\) vertices with no induced \(K_{1,3}\) is Hamiltonian if every endvertex of each induced net of \(G\) has degree at least \(( n - 2) / 3\).