Strongly even cycle decomposable 4-regular line graphs
From MaRDI portal
Publication:2662802
DOI10.1016/j.ejc.2021.103315zbMath1461.05169OpenAlexW3131578877MaRDI QIDQ2662802
Jiancheng Wang, Yan Yang, Wenzhong Liu, Qing Cui
Publication date: 14 April 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2021.103315
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
On 4-connected 4-regular graphs without even cycle decompositions ⋮ Strongly even cycle decomposable non-planar line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On even cycle decompositions of 4-regular line graphs
- Even cycle decompositions of 4-regular graphs and line graphs
- Generation and properties of snarks
- How many conjectures can you stand? A survey
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- Nowhere-zero integral flows on a bidirected graph
- Signed graphs
- Signed graph coloring
- Even circuits in planar graphs
- On a closure concept in claw-free graphs
- On even cycle decompositions of line graphs of cubic graphs
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
- Strongly Even-Cycle Decomposable Graphs
- Signed Graphs and Geometry
- A Theorem on Planar Graphs
- Hamiltonian results inK1,3-free graphs
- Circuit Covers of Signed Graphs
- On Graphic-Minimal Spaces
- On even circuit decompositions of eulerian graphs
- Circuit covers of cubic signed graphs
- Reflections on graph theory
- Circuit Covers of Signed Eulerian Graphs
- Shorter signed circuit covers of graphs
- (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)
This page was built for publication: Strongly even cycle decomposable 4-regular line graphs
