ブラウザの設定でJava Scriptの使用を有効にしてご利用ください。
出典:Wikipedia
出典:『Wikipedia』 (2010/03/01 19:38 UTC 版)
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.
exact coloring