Math 2.0

concept

Graph colouring

Summary

A colouring of a graph assigns colours to the vertices so that adjacent vertices get different colours. Colourings model scheduling and other conflict problems. The node graph colouring gives the precise definition.

What this node needs for W2
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Graph_coloring, Definition and terminology

What links here

Definitions