Clique coverings of graphs V: maximal-clique partitions

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 th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Bulletin of the Australian Mathematical Society 1982-06, Vol.25 (3), p.337-356
Hauptverfasser:	Pullman, N.J., Shank, H., Wallis, W.D.
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!