scientific article; zbMATH DE number 3735866
From MaRDI portal
Publication:3922720
zbMATH Open0469.05051MaRDI QIDQ3922720FDOQ3922720
Authors: Norman J. Pullman, Alan Donald 
Publication date: 1981
Title of this publication is not available (Why is that?)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (11)
- An overview of graph covering and partitioning
- On the partition and coloring of a graph by cliques
- Pairwise balanced designs and sigma clique partitions
- Extremal clique coverings of complementary graphs
- Regarding two conjectures on clique and biclique partitions
- Minimal clique partitions and pairwise balanced designs
- Clique partitions and clique coverings
- Asymptotic values of clique partition numbers
- Linear spaces with many small lines
- Applications of edge coverings by cliques
- The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
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)
