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:
“Hunger makes you restless. You dream about food—not just any food, but perfect food, the best food, magical meals, famous and awe-inspiring, the one piece of meat, the exact taste of buttery corn, tomatoes so ripe they split and sweeten the air, beans so crisp they snap between the teeth, gravy like mother’s milk singing to your bloodstream.”
—Dorothy Allison (b. 1953)