Two New Hamilton Results for K_(1,4)-Free Graphs
Bian Qiu · 2002
A graph is called K 1,4 if G has no induced K 1,4 as a subgraph.Using the vertex inserting method,two new sufficient conditions for K 1,4 -free graph to be hamiltonian or hamilton connected have been provided in this paper.