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