Recommendations
Cites work
- scientific article; zbMATH DE number 4006296 (Why is no real title available?)
- A reduction method to find spanning Eulerian subgraphs
- Contractions of graphs with no spanning Eulerian subgraphs
- Existence of dominating cycles and paths
- Existence of spanning and dominating trails and circuits
- Graph theory
- Hamiltonian line graphs
- On Spanning and Dominating Circuits in Graphs
- On circuits and pancyclic line graphs
- On hamiltonian line graphs
- Spanning trails
- The Factorization of Linear Graphs
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
- scientific article; zbMATH DE number 6604940 (Why is no real title available?)
- 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)
