Cycle decompositions and constructive characterizations

DOI10.5614/ejgta.2019.7.2.15zbMath1467.05138arXiv1708.09141OpenAlexW2980638711MaRDI QIDQ5009962

Irene Heinrich, Manuel Streicher

Publication date: 23 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.09141

zbMATH Keywords

Eulerian graphscycle decompositioncycle packingconstructive characterizationcycle covering

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

$C_4$-decomposition of the tensor product of complete graphs

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• NP-completeness of some problems of partitioning and covering in graphs
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Eulerian graphs and related topics. Part 1, Volume 1
• A partial k-arboretum of graphs with bounded treewidth
• The NP-Completeness of Some Edge-Partition Problems
• Approximation algorithms and hardness results for cycle packing problems
• Maximum cycle packing using SPR-trees