Hamiltonicity of 2-connected image-free graphs Original Research Article

A graph G is called image-free if G contains no induced subgraph isomorphic to any image, image. Let G be a 2-connected image-free graph of order image. If image, then G is hamiltonian or image, where image is a graph obtained by joining a pair of nonadjacent vertices in a image and image is a family of nonhamiltonian graphs of connectivity 2.