Article ID Journal Published Year Pages File Type
8903182 Discrete Mathematics 2017 6 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Forbidden set of induced subgraphs for 2-connected supereulerian graphs
Authors
, ,