Forbidden set of induced subgraphs for 2-connected supereulerian graphs

As an application, we characterize all the forbidden triples H with K1,3∈H such that every 2-connected H-free graph is supereulerian. As a byproduct, we also characterize minimal 2-connected non-supereulerian claw-free graphs.