Even cycle decompositions of 4-regular graphs and line graphs

DOI10.1016/j.disc.2011.12.007zbMath1246.05087MaRDI QIDQ442390

Klas Markström

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

zbMATH Keywords

cycle decompositions; line graphs; cycle double covers

Mathematics Subject Classification ID

05C38: Paths and cycles

05C76: Graph operations (line graphs, products, etc.)

Related Items

On even cycle decompositions of 4-regular line graphs, Generation and properties of snarks, On even cycle decompositions of line graphs of cubic graphs, Even cycles and even 2-factors in the line graph of a simple graph, Edge-colorings of 4-regular graphs with the minimum number of palettes, Strongly even cycle decomposable 4-regular line graphs, On the simultaneous edge coloring of graphs, Strongly Even-Cycle Decomposable Graphs

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