scientific article; zbMATH DE number 446493
From MaRDI portal
Publication:3142415
Recommendations
Cited in
(35)- Circle graphs and the cycle double cover conjecture
- Triangle-free circuit decompositions and Petersen minor
- The construction and reduction of strong snarks
- Circuit decompositions of Eulerian graphs
- Circuit decompositions and shortest circuit coverings of hypergraphs
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- Nowhere-zero 4-flows and cycle double covers
- An overview of graph covering and partitioning
- Even cycle decompositions of index 3 by a novel coloring technique
- On 4-connected 4-regular graphs without even cycle decompositions
- On even cycle decompositions of line graphs of cubic graphs
- Even-cycle decompositions of graphs with no odd-K₄-minor
- Even cycles and even 2-factors in the line graph of a simple graph
- Strongly even cycle decomposable 4-regular line graphs
- Edge-partitioning 3-edge-connected graphs into paths
- Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
- scientific article; zbMATH DE number 434907 (Why is no real title available?)
- The Pure Prime Circle Orbit Conjecture
- Construction of permutation snarks
- On even cycle decompositions of 4-regular line graphs
- scientific article; zbMATH DE number 1189241 (Why is no real title available?)
- Cycle double covers and the semi-Kotzig frame
- On even circuit decompositions of eulerian graphs
- Even cycle decompositions of 4-regular graphs and line graphs
- Hamilton weights and Petersen minors
- Generation and properties of snarks
- Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
- Cubic graphs with no short cycle covers
- Compatible circuit decompositions of 4‐regular graphs
- Circuit double covers of graphs
- Strongly even cycle decomposable non-planar line graphs
- Kotzig frames and circuit double covers
- Even cycle decompositions of the line graphs of cubic graphs
- Cycle covers (I) - minimal contra pairs and Hamilton weights
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 Q3142415)