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
. Graphs that admit exact colorings have been classified.
- A Bibliography of Harmonious Colourings and Achromatic Number by Keith Edwards