Hamiltonicity of 2-connected }K_(1,4),K_(1,4)+e}-free graphs

摘要

A graph G is called {H_1,H_2,…,H_k} -free if G contains no induced subgraph isomorphic to any H_i, 1≤i≤k. Let G be a 2-connected {K_(1,4),K_(1,4)+e}-free graph of order n≥13. If δ(G)≥n/4, then G is hamiltonian or G∈F, where K_(1,4)+e is a graph obtained by joining a pair of nonadjacent vertices in a K_(1,4) and F is a family of nonhamiltonian graphs of connectivity 2.