Extremal clique coverings of complementary graphs (Q1821116)

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.