Hamiltonicity of {K1,4,K1,4+e}-free graphs Original Research Article

A graph G is called {H1,H2,…,Hk}-free if G contains no induced subgraph isomorphic to any Hi, 1⩽i⩽k. Let G be a 3-connected {K1,4,K1,4+e}-free graphs of order n⩾30. If δ(G)⩾(n+5)/5, then G is hamiltonian, where K1,4+e is a graph obtained by joining a pair of nonadjacent vertices in a K1,4.