info prev up next book cdrom email home

Brelaz's Heuristic Algorithm

An Algorithm which can be used to find a good, but not necessarily minimal, Edge or Vertex coloring for a Graph.

See also Chromatic Number




© 1996-9 Eric W. Weisstein
1999-05-26