scientific article; zbMATH DE number 3885954
From MaRDI portal
Publication:3220629
Recommendations
Cited in
(22)- Circle graphs and the cycle double cover conjecture
- Circuit double covers in special types of cubic graphs
- Proof of the strong 2-cover conjecture for planar graphs
- Compatible path-cycle-decompositions of plane graphs
- Equivalence of Fleischner's and Thomassen's conjectures
- The smallest nontrivial snarks of oddness 4
- Cycle double covers and non-separating cycles
- Equivalence of Jackson's and Thomassen's conjectures
- Forbidden pairs and the existence of a dominating cycle
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- Circuit extension and circuit double cover of graphs
- Hamilton cycles in 5-connected line graphs
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Circuit double covers of graphs
- How many conjectures can you stand? A survey
- Perfect pseudo-matchings in cubic graphs
- Non-separating cycles and 5-cycle double covers
- The domination and independent domination numbers of some families of snarks
- Strong 5-cycle double covers of graphs
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner
- On semiextensions and circuit double covers
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220629)
