Clique coverings of graphs V: maximal-clique partitions
From MaRDI portal
Publication:3967566
DOI10.1017/S0004972700005414zbMath0502.05047MaRDI QIDQ3967566
Herbert S. Shank, Norman J. Pullman, Walter D. Wallis
Publication date: 1982
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Regarding two conjectures on clique and biclique partitions ⋮ An overview of graph covering and partitioning ⋮ Extensions of graph inversion to support an artificially intelligent modeling environment ⋮ Maximal-clique partitions and the roller coaster conjecture ⋮ Some observations on the smallest adjacency eigenvalue of a graph ⋮ Extremal clique coverings of complementary graphs ⋮ Applications of edge coverings by cliques ⋮ The clique-partitioning problem
Cites Work
This page was built for publication: Clique coverings of graphs V: maximal-clique partitions