Abstract

Let H be a set of graphs. A graph G is said to be H-free if G does not contain H as an induced subgraph for all H∈H, and we call H a forbidden pair if |H|=2. A graph is called supereulerian if it contains a spanning connected even subgraph. In 1979, Pulleyblank showed that determining whether a graph is supereulerian, even when restricted to planar graphs, is NP-complete. In this paper, we characterize all pairs of graphs R,S (not necessary connected) such that every 2-connected or 2-edge-connected {R,S}-free graph (of sufficiently large order) is supereulerian. We also characterize all minimal 2-connected non-supereulerian graphs, which extends a result by the third author and Xiong (2017) [29].

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.