First kind of weak total coloring of Graph C_m∨W_n(m,n≥3)
Guo Liqin
Abstract
Guo Liqin
Abstract
The conjecture about the first kind of weak total coloring is proved through the study of the first kind of weak total coloring of Cm∨Wn.The first kind of weak total coloring chromatic number of Cm∨Wn is given by constructing concrete coloring.
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 conjecture about the first kind of weak total coloring is proved through the study of the first kind of weak total coloring of Cm∨Wn.The first kind of weak total coloring chromatic number of Cm∨Wn is given by constructing concrete coloring.
Key concepts: Total coloring, Fractional coloring, Conjecture, Complete coloring, Combinatorics, Mathematics, Brooks' theorem, Graph coloring