Fan-type conditions for spanning Eulerian subgraphs
From MaRDI portal
Publication:897267
DOI10.1007/S00373-014-1511-4zbMATH Open1327.05239OpenAlexW2132309220MaRDI QIDQ897267FDOQ897267
Authors: Wei-Guo Chen, Zhi-Hong Chen 
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1511-4
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12)
Cites Work
- Graphs without spanning closed trails
- On dominating and spanning circuits in graphs
- Graph theory with applications
- A reduction method to find spanning Eulerian subgraphs
- A note on graphs spanned by Eulerian graphs
- New sufficient conditions for cycles in graphs
- On Spanning and Dominating Circuits in Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Collapsible graphs and matchings
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- Contractions of graphs with no spanning Eulerian subgraphs
- Supereulerian graphs and the Petersen graph
- Title not available (Why is that?)
- Supereulerian graphs, independent sets, and degree-sum conditions
- Lai's conditions for spanning and dominating closed trails
- Fan-type conditions for collapsible graphs
- Properties of Catlin's reduced graphs and supereulerian graphs
- A degree condition for spanning eulerian subgraphs
Cited In (3)
This page was built for publication: Fan-type conditions for spanning Eulerian subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897267)
