Exact coloring

The n-coloring of Complete graph $K_n$ is an exact coloring.

In graph theory, an exact coloring is a (proper) vertex coloring in which every pair of colors appears on exactly one pair of adjacent vertices. In essence, an exact coloring is a coloring that is both harmonious and complete. Graphs that admit exact colorings have been classified.

External links

• [1] A Bibliography of Harmonious Colourings and Achromatic Number by Keith Edwards