Forbidden set of induced subgraphs for 2-connected supereulerian graphs

DOI10.1016/j.disc.2017.08.006zbMath1370.05127OpenAlexW2752168245MaRDI QIDQ2404369

Shipeng Wang, Limning Xiong

Publication date: 18 September 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.08.006

zbMATH Keywords

claw-free graphinduced subgraphsuper-Eulerian graphforbidden set

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Forbidden subgraphs on Hamiltonian index ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Forbidden subgraphs for collapsible graphs and supereulerian graphs

Cites Work

• Unnamed Item
• Forbidden pairs for spanning (closed) trails
• Forbidden triples and traceability: A characterization
• Characterizing forbidden pairs for hamiltonian properties
• Traceability in graphs with forbidden triples of subgraphs
• Minimal \(2\)-connected non-Hamiltonian claw-free graphs
• Characterizing forbidden clawless triples implying Hamiltonian graphs
• Forbidden triples for Hamiltonicity
• Supereulerian graphs and excluded induced minors
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden pairs and the existence of a dominating cycle
• Forbidden triples for perfect matchings
• Forbidden triples implying Hamiltonicity: for all graphs
• Potential forbidden triples implying hamiltonicity: for sufficiently large graphs