Even circuits in planar graphs
From MaRDI portal
Cites work
Cited in
(20)- On the simultaneous edge coloring of graphs
- The construction and reduction of strong snarks
- An Eulerian exposition
- Graphs with the Circuit Cover Property
- Triangle-free circuit decompositions and Petersen minor
- On circuit decomposition of planar Eulerian graphs
- 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
- \(H\)-colorings for 4-regular graphs
- Smallest (1, 2)‐eulerian weight and shortest cycle covering
- Strongly even-cycle decomposable graphs
- Even cycles and even 2-factors in the line graph of a simple graph
- Strongly even cycle decomposable 4-regular line graphs
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
- Strongly even cycle decomposable non-planar line graphs
- Circuit decompositions of Eulerian graphs
- On even circuit decompositions of eulerian graphs
- On even cycle decompositions of 4-regular line graphs
- Even cycle decompositions of 4-regular graphs and line graphs
This page was built for publication: Even circuits in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168333)