Homogeneously Traceable Results in Claw-Free Graphs
Lisa R. Markus · 1993
A graph is homogeneously traceable if for each v in V(C) there is a Hamilton path starting at v. In this paper we find a sufficient condition for a claw-free graph to be homogeneously traceable in terms of a neighborhood union condition. Hamilton path, Neighborhood union.