Project Links Logo Artwork
Graph Theory: Industrial Drilling
Home > Graph Theory: Industrial Drilling > Solving the Drilling Problem > Vertex Coloring
Crib Sheet
Library
Help
Map
Problem List
Module Home
Links Home


conceptsdiscoverapplycollaboratepractice
 
 
go backgo forward
go backgo forward

Vertex Coloring

  1. A k-coloring of a graph is a mapping of the vertices of onto a set with elements such that adjacent vertices are mapped onto different elements. These elements are called colors; often, these elements are denoted by integers .
  2. A graph is called k-colorable if it has a k-coloring.
  3. The chromatic number of a graph is the minimal for which the graph is k-colorable.
  4. A graph with chromatic number is called k-chromatic.
 
 
go backgo forward
go backgo forward