Hamiltonicity of {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 3-connected {K_(1,4), K_(1,4) + e}-free graphs of order n ≥ 30. If δ(G) ≥ (n + 5)/5, then G is hamiltonian, where K_(1,4) + e is a graph obtained by joining a pair of nonadjacent vertices in a K_(1,4).