Traceability in graphs with forbidden triples of subgraphs Original Research Article

If F is a collection of connected graphs, and if a graph G does not contain any member of F as an induced subgraph, then G is said to be F-free. The members of F in this situation are called forbidden subgraphs. In a previous paper (Gould and Harris, 1995) the authors demonstrated two families of triples of subgraphs which imply traceability when forbidden. In this paper the authors identify two additional families that enjoy this same property.