Forbidden subgraphs for collapsible graphs and supereulerian graphs
DOI10.7151/DMGT.2270zbMATH Open1485.05097OpenAlexW2996573329WikidataQ126534700 ScholiaQ126534700MaRDI QIDQ2118236FDOQ2118236
Authors: Xia Liu, Liming 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
Recommendations
- Forbidden subgraphs for supereulerian and Hamiltonian graphs
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- Forbidden subgraphs and forbidden substructures
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs
- Forbidden subgraphs and the König-Egerváry property
- A note on collapsible graphs and super-Eulerian graphs
- scientific article; zbMATH DE number 4101231
- scientific article; zbMATH DE number 1185308
- Super-Eulerian graphs, collapsible graphs and matchings
- Forbidden subgraphs in connected graphs
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Graph theory
- On a closure concept in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Title not available (Why is that?)
- Graph whose edges are in small cycles
- Supereulerian graphs and excluded induced minors
- Forbidden pairs for spanning (closed) trails
- Erratum to: ``Forbidden pairs for spanning (closed) trails
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs
- Forbidden subgraphs and weak locally connected graphs
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
Cited In (6)
- Collapsible subgraphs of a 4-edge-connected graph
- Title not available (Why is that?)
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- A note on collapsible graphs and super-Eulerian graphs
- Forbidden pairs of disconnected graphs for supereulerianity of connected graphs
- Fan-type conditions for collapsible graphs
This page was built for publication: Forbidden subgraphs for collapsible graphs and supereulerian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118236)
