Wen Fei
Abstract
The first kind of weak total coloring of graphs is a total coloring such that two adjacent vertices and two adjacent edges are not assigned the same colors.The minimum number of colors is called the first kind of weak total chromatic number.The first kind of weak total coloring chromatic number of Sm∨Wn(m,n≥3) is discussed in the paper.
A significance statement is not available in the OpenAlex record.
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.
The first kind of weak total coloring of graphs is a total coloring such that two adjacent vertices and two adjacent edges are not assigned the same colors.The minimum number of colors is called the first kind of weak total chromatic number.The first kind of weak total coloring chromatic number of Sm∨Wn(m,n≥3) is discussed in the paper.
Key concepts: Total coloring, Brooks' theorem, Combinatorics, Complete coloring, Fractional coloring, Mathematics, Chromatic scale, Edge coloring