Path coloring

In graph theory, path coloring usually refers to one of two problems:

In both the above problems, the goal is usually to minimise the number of colors used in the coloring. In different variants of path coloring, G may be a simple graph, digraph or multigraph.

References


This article is issued from Wikipedia - version of the Wednesday, September 09, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.