Wan Hui-min
Abstract
A proper total coloring of graph G is called adjacent vertex distinguishing if the color sets of every two adjacent vertices are different.The paper determines the adjacent vertex distinguishing total chromatic numbers of k4-minor-free graphs.
OpenAlex reports 9 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.
A proper total coloring of graph G is called adjacent vertex distinguishing if the color sets of every two adjacent vertices are different.The paper determines the adjacent vertex distinguishing total chromatic numbers of k4-minor-free graphs.
Key concepts: Combinatorics, Vertex (graph theory), Fractional coloring, Chromatic scale, Brooks' theorem, Complete coloring, Total coloring, Mathematics