2011Journal of Suzhou University of Science and TechnologyRequires access

First kind of weak total coloring of Graph C_m∨W_n(m,n≥3)

Guo Liqin

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Total coloring, Fractional coloring, Conjecture, Complete coloring, Combinatorics, Mathematics, Brooks' theorem, Graph coloring

Related papers

Back to paper searchBrowse research topicsOriginal source
First kind of weak total coloring of Graph C_m∨W_n(m,n≥3) — Research Paper | ScholarLens