Extremal clique coverings of complementary graphs

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

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.

Recommendations

Cites work

Cited in

(20)

This page was built for publication: Extremal clique coverings of complementary graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821116)