Chen Xiang-en
Abstract
D(β)-vertex-distinguishing total coloring of graph G is a proper total coloring of graph G,which any two vertices whose distance is not large than β have different color sets.In this article,D(5)-vertex-distinguishing total coloring of the cycle are discussed.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
D(β)-vertex-distinguishing total coloring of graph G is a proper total coloring of graph G,which any two vertices whose distance is not large than β have different color sets.In this article,D(5)-vertex-distinguishing total coloring of the cycle are discussed.
Key concepts: Fractional coloring, Complete coloring, Total coloring, Combinatorics, List coloring, Greedy coloring, Vertex (graph theory), Edge coloring