The (adjacent) vertex-distinguishing total coloring of the mycielski graphs and the cartesian product graphs

Authors:
Yanli Sun;Lei Sun
Affiliations:
College of Information and Engineering, Taishan Medical University, Taian, P.R. China;Department of Mathematics, Shandong Normal University, Jinan, P.R. China
Venue:
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Year:
2005

Citing 3
Cited 0

On the chromatic number of the lexicographic product and the Cartesian sum of graphs

Proceedings of the 2nd Slovenian conference on Algebraic and topological methods in graph theory
Coloring graph products—a survey

Discrete Mathematics - Special issue on combinatorics
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The graph obtained by the famous Mycielski's construction is called the Mycielski graph. This paper focuses on the relation between the basic graphs and two classes of constructed graphs on the (adjacent) vertex-distinguishing total coloring. And some sufficient conditions with which the Mycielski graphs and the Cartesian product graphs satisfy the adjacent vertex-distinguishing total coloring conjecture are given.