Spanning Eulerian subgraphs and matchings
From MaRDI portal
Publication:1124608
DOI10.1016/0012-365X(89)90303-8zbMATH Open0679.05051MaRDI QIDQ1124608FDOQ1124608
Authors: Paul A. Catlin 
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- The Factorization of Linear Graphs
- A reduction method to find spanning Eulerian subgraphs
- On hamiltonian line graphs
- Existence of dominating cycles and paths
- On Spanning and Dominating Circuits in Graphs
- Spanning trails
- Hamiltonian line graphs
- Title not available (Why is that?)
- On circuits and pancyclic line graphs
- Contractions of graphs with no spanning Eulerian subgraphs
- Existence of spanning and dominating trails and circuits
Cited In (15)
- A note on minimum degree conditions for supereulerian graphs
- Collapsible graphs and matchings
- Graphs without spanning closed trails
- On dominating and spanning circuits in graphs
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
- Duality in graph families
- Title not available (Why is that?)
- Supereulerian graphs, independent sets, and degree-sum conditions
- Super-Eulerian graphs, collapsible graphs and matchings
- Spanning closed trail and hamiltonian cycle in grid graphs
- Collapsible graphs and Hamilton cycles of line graphs
- A reduction method to find spanning Eulerian subgraphs
- Spanning closed trails in graphs
- Contractions of graphs with no spanning Eulerian subgraphs
- Spanning Eulerian subgraphs of large size
This page was built for publication: Spanning Eulerian subgraphs and matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124608)
