Pairs of forbidden class of subgraphs concerning and P₆ to have a cycle containing specified vertices
In [3], Faudree and Gould showed that if a 2-connected graph contains no and P₆ as an induced subgraph, then the graph is hamiltonian. In this paper, we consider the extension of this result to cycles passing through specified vertices. We define the families of graphs which are extension of the forbidden pair and P₆, and prove that the forbidden families implies the existence of cycles passing through specified vertices.