On 4-connected graphs without even cycle decompositions
From MaRDI portal
Publication:5936064
DOI10.1016/S0012-365X(00)00380-0zbMath0983.05067OpenAlexW1983509073MaRDI QIDQ5936064
Publication date: 2 July 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00380-0
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
Superposition and constructions of graphs without nowhere-zero \(k\)-flows ⋮ On 4-connected 4-regular graphs without even cycle decompositions ⋮ On even cycle decompositions of 4-regular line graphs ⋮ On even cycle decompositions of line graphs of cubic graphs ⋮ Even cycle decompositions of 4-regular graphs and line graphs