Forbidden triples and traceability: a characterization Original Research Article

Given a connected graph G, a family F of connected graphs is called a forbidden family if no induced subgraph of G is isomorphic to any graph in F. If this is the case, G is said to be F-free. In earlier papers the authors identified four distinct families of triples of subgraphs that imply traceability when they are forbidden in sufficiently large graphs. In this paper the authors introduce a fifth family and show these are all such families.