Delta-system decompositions of graphs
From MaRDI portal
Publication:1356709
DOI10.1016/S0012-365X(96)00054-4zbMath0878.68089MaRDI QIDQ1356709
Publication date: 4 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Edge decompositions and rooted packings of graphs ⋮ Edge decompositions into two kinds of graphs ⋮ Clique and anticlique partitions of graphs
Cites Work
- Unnamed Item
- Decomposition of large uniform hypergraphs
- A note on the decomposition of graphs into isomorphic matchings
- Decompositions of partially ordered sets into chains and antichains of given size
- NP-completeness of graph decomposition problems
- Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
- Intersection Theorems for Systems of Sets
This page was built for publication: Delta-system decompositions of graphs