Minimal clique partitions and pairwise balanced designs
From MaRDI portal
Publication:1102981
DOI10.1016/0012-365X(86)90098-1zbMath0645.05044OpenAlexW2040289010MaRDI QIDQ1102981
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(86)90098-1
Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (10)
Pairwise balanced designs and sigma clique partitions ⋮ Linear spaces with many small lines ⋮ Edge clique covering sum of graphs ⋮ The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\) ⋮ The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\) ⋮ Clique partitions of distance multigraphs ⋮ On the partition and coloring of a graph by cliques ⋮ Some linear spaces with lines of two lengths ⋮ The clique-partitioning problem ⋮ On the number of blocks in a perfect covering of v points
Cites Work
This page was built for publication: Minimal clique partitions and pairwise balanced designs
