ScholarLens Back to search
2006•He'nan kexueRequires access

The Adjacent Vertex-Distinguishing Total Coloring of Special Graphs

Hao Jianxiu

Open publisher page 0 citations

Abstract

The adjacent vertex-distinguishing total coloring of a graph satisfies the condition that the color sets of adjacent vertexes are different.This kind of coloring has stronger restrain than the proper total coloring.In this paper,the adjacent vertex-distinguishing total chromatic number of two special classes of complete r-partite,generalized circles and generalized Mycielski′s graph are presented.

About this research paper

What this paper is about

The adjacent vertex-distinguishing total coloring of a graph satisfies the condition that the color sets of adjacent vertexes are different.This kind of coloring has stronger restrain than the proper total coloring.In this paper,the adjacent vertex-distinguishing total chromatic number of two special classes of complete r-partite,generalized circles and generalized Mycielski′s graph are presented.

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 adjacent vertex-distinguishing total coloring of a graph satisfies the condition that the color sets of adjacent vertexes are different.This kind of coloring has stronger restrain than the proper total coloring.In this paper,the adjacent vertex-distinguishing total chromatic number of two special classes of complete r-partite,generalized circles and generalized Mycielski′s graph are presented.

Key concepts: Fractional coloring, Total coloring, Combinatorics, Brooks' theorem, Complete coloring, Vertex (graph theory), List coloring, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Adjacent Vertex-Distinguishing Total Coloring of Special Graphs — Research Paper | ScholarLens