A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Clique coverings of graphs V: maximal-clique partitions

1982
*
Bulletin of the Australian Mathematical Society
*

A maximal-clique partition of a graph G is a way of covering G with maximal complete subgraphs, such that every edge belongs to exactly one of the subgraphs. If G has a maximal-clique partition, the maximal-clique partition number of G is the smallest cardinality of such partitions. In this paper the existence of maximal-clique partitions is discussed -for example, we explicitly describe all graphs with maximal degree at most four which have maximal-clique partitions -and discuss the

doi:10.1017/s0004972700005414
fatcat:z4b6ulxa5rhvrgdtapbelizgu4