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.
Famous quotes containing the word exact:
“Now I have entered the year without words.
I note the queer entrance and the exact voltage.”
—Anne Sexton (1928–1974)