# Path coloring

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, ${\displaystyle G}$ may be a simple graph, digraph or multigraph.