Node-colored graph

In graph theory, a node- colored graph is a graph whose nodes are assigned colors.

Formally, the color is indicated by an element of any discrete set . For example, it can correspond to a natural number (it is usually not the value of the number that matters, but the distinguishability of the numbers from one another).

The coloring of a node-colored graph is then a function that maps the nodes into the set of colors.

literature

• Reinhard Diestel: graph theory . 3. Edition. Springer, 2006, ISBN 3-540-21391-0 ( online ).