3K2-decomposition of a graph

DOI10.1007/BF01903577MaRDI QIDQ3919753zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

decomposition

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites work

• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• scientific article; zbMATH DE number 3710196 (Why is no real title available?)

Cited in

(14)

• Polynomial cases of graph decomposition: A complete solution of Holyer's problem
• Edge decompositions into two kinds of graphs
• NP-completeness of graph decomposition problems
• Random packings of graphs
• Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial
• On colored designs. I
• On some multigraph decomposition problems and their computational complexity
• Edge decompositions and rooted packings of graphs
• Combinatorial and computational aspects of graph packing and graph decomposition
• On rooted packings, decompositions, and factors of graphs
• Towards a solution of the Holyer's problem
• Colouring problems for symmetric configurations with block size 3
• The complexity of decomposing a graph into a matching and a bounded linear forest
• Triangle decompositions of planar graphs

This page was built for publication: 3K2-decomposition of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919753)