Even cycle decompositions of 4-regular graphs and line graphs
From MaRDI portal
Publication:442390
DOI10.1016/J.DISC.2011.12.007zbMath1246.05087OpenAlexW2124241315MaRDI QIDQ442390
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.007
Related Items (12)
Edge-colorings of 4-regular graphs with the minimum number of palettes ⋮ Even cycle decompositions of index 3 by a novel coloring technique ⋮ On 4-connected 4-regular graphs without even cycle decompositions ⋮ On the simultaneous edge coloring of graphs ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ On even cycle decompositions of 4-regular line graphs ⋮ Even cycles and even 2-factors in the line graph of a simple graph ⋮ On even cycle decompositions of line graphs of cubic graphs ⋮ Strongly Even-Cycle Decomposable Graphs ⋮ \(H\)-colorings for 4-regular graphs ⋮ Strongly even cycle decomposable non-planar line graphs ⋮ Generation and properties of snarks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Even polyhedral decompositions of cubic graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Even circuits in planar graphs
- Double covers of cubic graphs with oddness 4
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Five cycle double covers of some cubic graphs
- Minors in random regular graphs
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- On even circuit decompositions of eulerian graphs
- Reflections on graph theory
- Polyhedral decompositions of cubic graphs
- (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)
- On cycle-double covers of graphs of small oddness
- On 4-connected graphs without even cycle decompositions
This page was built for publication: Even cycle decompositions of 4-regular graphs and line graphs
