Graph Coloring

Description:

• A coloring of a simple graph is the assignment of a color to each vertex of the graph so that no two adjacent vertices are assigned the same color.
  • Typically done with a Chromatic Number

Four color theorem:

• theorem The Chromatic Number of a Planar Graph is never greater than four