Clique Coverings of Complements of Paths and Cycles

Let cc(▪) be the minimum number of complete subgraphs necessary to cover the edges of the complement of a graph G. When G is a path or cycle of length n, exact values of cc(▪) are found for small n and bounds are determined implying that cc(▪) is of order log n. Logarithmic bounds on cc(▪) are given...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	de Caen, D., Gregory, David A., Pullman, N.J.
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Combinatorics & graph theory Optimization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!