摘要
Let G(V, E) be a simple graph, f: C→V(G) be an injection, and all vertices on the path whose length is no longer than n be assigned different colors, where C is a color set. Then f is called an n-coloring of G. If |C|=m, f is called m-n-coloring graph, G m-n-colorable if there exists a k-n-coloring of G for some k≤m.
基金
Project supported by the National Natural Science Foundation of China and Natural Science Fund of Gansu Province, China.
