3K2-decomposition of a graph
From MaRDI portal
Publication:3919753
DOI10.1007/BF01903577zbMath0467.05057OpenAlexW1980484894MaRDI QIDQ3919753
Arie Bialostocki, Yehuda Roditty
Publication date: 1982
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01903577
Related Items (13)
Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial ⋮ On colored designs. I ⋮ Edge decompositions and rooted packings of graphs ⋮ Towards a solution of the Holyer's problem ⋮ Colouring problems for symmetric configurations with block size 3 ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ NP-completeness of graph decomposition problems ⋮ On Rooted Packings, Decompositions, and Factors of Graphs ⋮ Triangle decompositions of planar graphs ⋮ Polynomial cases of graph decomposition: A complete solution of Holyer's problem ⋮ On some multigraph decomposition problems and their computational complexity ⋮ Edge decompositions into two kinds of graphs ⋮ Random packings of graphs
Cites Work
This page was built for publication: 3K2-decomposition of a graph
