A graph G is{K_(1,4),K_(1,4)+e}-free if G contains no induced subgraph isomorphic to K_(1,4) or KI,a+e In this paper,we show that G has a path which is either hamiltonian or of length at least 25(G)+2 if G is a connec...A graph G is{K_(1,4),K_(1,4)+e}-free if G contains no induced subgraph isomorphic to K_(1,4) or KI,a+e In this paper,we show that G has a path which is either hamiltonian or of length at least 25(G)+2 if G is a connected{K_(1,4),K_(1,4)+e}-free graph on at least 7 vertices.展开更多
基金Supported by Scientific Research Program of the Higher Education Institution of Xinjiang(Grant No.2011S30)Science Foundation of Xinjiang Normal University
文摘A graph G is{K_(1,4),K_(1,4)+e}-free if G contains no induced subgraph isomorphic to K_(1,4) or KI,a+e In this paper,we show that G has a path which is either hamiltonian or of length at least 25(G)+2 if G is a connected{K_(1,4),K_(1,4)+e}-free graph on at least 7 vertices.
