A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
2001
Discrete Mathematics
Let G be a 2-connected claw-free graph on n vertices. Let k (G) be the minimum degree sum among k-element independent set of vertices in G. It is proved that if 4(G)¿n + 3 then G is hamiltonian or else G belong to the known family of graphs. This is a generalization of the best known su cient condition on hamiltonicity in claw-free 2-connected graphs given independently by Liu, Zhang and Broersma. Moreover, it is shown that the problem HAMILTONIAN CYCLE restricted to claw-free graphs G = (V; E)
doi:10.1016/s0012-365x(00)00436-2
fatcat:waq752u2fzdgdfx4pvwm2xehuu