scientific article; zbMATH DE number 3735866

MaRDI QIDQ3922720zbMATHFDO

Authors Norman J. Pullman, Alan Donald

Publication date 1981

zbMATH Keywords

cliqueclique partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(11)

• Regarding two conjectures on clique and biclique partitions
• Pairwise balanced designs and sigma clique partitions
• Asymptotic values of clique partition numbers
• An overview of graph covering and partitioning
• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
• Applications of edge coverings by cliques
• Linear spaces with many small lines
• On the partition and coloring of a graph by cliques
• Extremal clique coverings of complementary graphs
• Minimal clique partitions and pairwise balanced designs
• Clique partitions and clique coverings

This page was built for publication:

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