Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
From MaRDI portal
Recommendations
Cites work
- A reduction method to find spanning Eulerian subgraphs
- Characterizations of derived graphs
- Contractibility techniques as a closure concept
- Decompositions and reductions of snarks
- Equivalence of Fleischner's and Thomassen's conjectures
- Graph theory with applications
- Hamiltonian results inK1,3-free graphs
- scientific article; zbMATH DE number 3885954 (Why is no real title available?)
- scientific article; zbMATH DE number 4108816 (Why is no real title available?)
- On a closure concept in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Reflections on graph theory
Cited in
(1)
This page was built for publication: Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439565)