scientific article
From MaRDI portal
Publication:3922720
zbMath0469.05051MaRDI QIDQ3922720
Alan Donald, Norman J. Pullman
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (11)
Regarding two conjectures on clique and biclique partitions ⋮ Pairwise balanced designs and sigma clique partitions ⋮ Linear spaces with many small lines ⋮ An overview of graph covering and partitioning ⋮ Minimal clique partitions and pairwise balanced designs ⋮ Clique partitions and clique coverings ⋮ The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\) ⋮ Asymptotic values of clique partition numbers ⋮ On the partition and coloring of a graph by cliques ⋮ Extremal clique coverings of complementary graphs ⋮ Applications of edge coverings by cliques
This page was built for publication:
