n-colorable graph

n-colorable graph

[¦en ‚kəl·ə·rə·bəl ′graf] (mathematics) A graph whose nodes can be colored using one of n colors on each node in such a way that no edge connects a pair of nodes with the same color.