Complete coloring

In graph theory, a complete coloring is a vertex coloring in which every pair of colors appears on at least one pair of adjacent vertices. Equivalently, a complete coloring is minimal in the sense that it cannot be transformed into a proper coloring with fewer colors by merging pairs of color classes. The achromatic number ψ(G) of a graph G is the maximum number of colors possible in any complete coloring of G. A complete coloring is the opposite of a harmonious coloring, which requires every pair of colors to appear on at most one pair of adjacent vertices. Finding ψ(G) is an optimization problem. The decision problem for complete coloring can be phrased as: INSTANCE: a graph G = (V, E) and positive integer k QUESTION: does there exist a partition of V into k or more disjoint sets V_1, V_2, ..., V_k such that each V_i is an independent set for G and such that for each pair of distinct sets V_i, V_j, V_i ∪ V_j is not an independent set. Determining the achromatic number is NP-hard; determining if it is greater than a given number is NP-complete, as shown by Yannakakis and Gavril in 1978 by transformation from the minimum maximal matching problem. Note that any coloring of a graph with the minimum number of colors must be a complete coloring, so minimizing the number of colors in a complete coloring is just a restatement of the standard graph coloring problem. For any fixed k, it is possible to determine whether the achromatic number of a given graph is at least k, in linear time. The optimization problem permits approximation and is approximable within a approximation ratio. The NP-completeness of the achromatic number problem holds also for some special classes of graphs: bipartite graphs, complements of bipartite graphs (that is, graphs having no independent set of more than two vertices), cographs and interval graphs, and even for trees. For complements of trees, the achromatic number can be computed in polynomial time. For trees, it can be approximated to within a constant factor.