Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903182 | Discrete Mathematics | 2017 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Shipeng Wang, Liming Xiong,