Fan-type conditions for spanning Eulerian subgraphs
From MaRDI portal
Publication:897267
DOI10.1007/s00373-014-1511-4zbMath1327.05239OpenAlexW2132309220MaRDI QIDQ897267
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
Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Circumferences of 3-connected claw-free graphs ⋮ Lai's conditions for spanning and dominating closed trails
Cites Work
- New sufficient conditions for cycles in graphs
- Contractions of graphs with no spanning Eulerian subgraphs
- Graphs without spanning closed trails
- On dominating and spanning circuits in graphs
- Supereulerian graphs, independent sets, and degree-sum conditions
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- Lai's conditions for spanning and dominating closed trails
- Properties of Catlin's reduced graphs and supereulerian graphs
- A note on graphs spanned by Eulerian graphs
- A reduction method to find spanning Eulerian subgraphs
- On Spanning and Dominating Circuits in Graphs
- Collapsible graphs and matchings
- A degree condition for spanning eulerian subgraphs
- Supereulerian graphs and the Petersen graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fan-type conditions for spanning Eulerian subgraphs
