Zentralblatt MATH
Publications of (and about) Paul Erdös
Zbl.No: 616.05042
Autor: de Caen, D.; Erdös, Paul; Pullmann, N.J.; Wormald, N.C.
Title: Extremal clique coverings of complementary graphs. (In English)
Source: Combinatorica 6, 309-314 (1986).
Review: The clique covering number, cc(G), is the least number of complete subgraphs needed to cover the edges of G; the clique partition number, cp(G), is the least number of complete subgraphs needed to partition the edge set of G. Let \bar G be the complement of G. The paper investigates bounds on max {cc(G)+cc(\bar G)}, max{cc(G)cc(\bar G)}, max{cp(G)+cp(\bar G)} and max{cp(G)cp(\bar G)}, taken over graphs G with n vertices.
Reviewer: C.R.J.Clapham
Classif.: * 05C35 Extremal problems (graph theory)
05C70 Factorization, etc.
Keywords: extremal problem; complementary graphs; clique covering number; clique partition number
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag