摘要
A t-tone coloring of a graph assigns t distinct colors to each vertex with vertices at distance d having fewer than d colors in common.The t-tone chromatic number of a graph is the smallest number of colors used in all t-tone colorings of that graph.In this article,we study t-tone coloring of some finite planar lattices and obtain exact formulas for their t-tone chromatic number.
基金
Supported by the National Natural Science Foundation of China(Grant No.12271210)
the Scientific Research Foundation of Jimei University(Grant No.Q202201).
