Strongly even cycle decomposable non-planar line graphs
From MaRDI portal
Publication:6204337
DOI10.1016/j.disc.2024.113921MaRDI QIDQ6204337
Li-ping Wang, Unnamed Author, Wenzhong Liu, Dan-dan Wang
Publication date: 27 March 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- 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
- Signed graphs
- Even circuits in planar graphs
- Spanning planar subgraphs of graphs in the torus and Klein bottle
- 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_4\)-minor
- Even cycles and even 2-factors in the line graph of a simple graph
- The connectivity of line-graphs
- Strongly even cycle decomposable 4-regular line graphs
- Strongly Even-Cycle Decomposable Graphs
- On even circuit decompositions of eulerian graphs
- Computing the orientable genus of projective 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 non-planar line graphs