Wei Zheng,
Ligong Wang
(2019)
A graph is called -free if contains no induced subgraph isomorphic to any graph , . We define
In this paper, we prove that (1) if is a connected -free graph of order and , then is traceable, (2) if is a 2-connected -free graph of order and for any two distinct pairs of non-adjacent vertices , of , then is traceable, i.e., has a Hamilton path, where is a graph obtained by joining a pair of non-adjacent vertices in a .