Forbidden subgraphs for collapsible graphs and supereulerian graphs

DOI10.7151/dmgt.2270zbMath1485.05097OpenAlexW2996573329WikidataQ126534700 ScholiaQ126534700MaRDI QIDQ2118236

Xia Liu, Limning Xiong

Publication date: 22 March 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2270

zbMATH Keywords

super-Eulerian graphsforbidden subgraphcollapsible graphs

Mathematics Subject Classification ID

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

Related Items (1)

Forbidden pairs of disconnected graphs for supereulerianity of connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Forbidden pairs for spanning (closed) trails
• Graph whose edges are in small cycles
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On a closure concept in claw-free graphs
• Erratum to: ``Forbidden pairs for spanning (closed) trails
• Pairs of forbidden subgraphs and 2-connected supereulerian graphs
• Forbidden subgraphs and weak locally connected graphs
• Supereulerian graphs and excluded induced minors
• Forbidden set of induced subgraphs for 2-connected supereulerian graphs
• A reduction method to find spanning Eulerian subgraphs

This page was built for publication: Forbidden subgraphs for collapsible graphs and supereulerian graphs