Forbidden set of induced subgraphs for 2-connected supereulerian graphs

摘要

Let H = {H-1, . . . , H-k} be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. We show that if the following statements hold,