Delta-system decompositions of graphs

DOI10.1016/S0012-365X(96)00054-4MaRDI QIDQ1356709zbMATH OpenFDO

Authors Zbigniew Lonc

Publication date 4 January 1998

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

delta-system

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 398969
• Solution of a delta-system decomposition problem
• Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial

Cites work

• scientific article; zbMATH DE number 3974987 (Why is no real title available?)
• A note on the decomposition of graphs into isomorphic matchings
• Decomposition of large uniform hypergraphs
• Decompositions of partially ordered sets into chains and antichains of given size
• Intersection Theorems for Systems of Sets
• NP-completeness of graph decomposition problems
• Packing, covering and decomposing of a complete uniform hypergraph into delta-systems

Cited in

(7)

• scientific article; zbMATH DE number 125474 (Why is no real title available?)
• Edge decompositions and rooted packings of graphs
• Clique and anticlique partitions of graphs
• Delta-systems and qualitative (in)dependence
• Clique and anticlique partitions of graphs
• Edge decompositions into two kinds of graphs
• Decomposition of the complete hypergraph into delta-systems. I

This page was built for publication: Delta-system decompositions of graphs

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