Journal of Applied Mathematics

General Vertex-Distinguishing Total Coloring of Graphs

Chanjuan Liu and Enqiang Zhu

Full-text: Open access

Abstract

The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k , for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges. In this paper, we figure out the exact value of this chromatic number of some special graphs and propose a conjecture on the upper bound of this chromatic number.

Article information

Source
J. Appl. Math., Volume 2014 (2014), Article ID 849748, 7 pages.

Dates
First available in Project Euclid: 2 March 2015

Permanent link to this document
https://projecteuclid.org/euclid.jam/1425305940

Digital Object Identifier
doi:10.1155/2014/849748

Mathematical Reviews number (MathSciNet)
MR3248925

Citation

Liu, Chanjuan; Zhu, Enqiang. General Vertex-Distinguishing Total Coloring of Graphs. J. Appl. Math. 2014 (2014), Article ID 849748, 7 pages. doi:10.1155/2014/849748. https://projecteuclid.org/euclid.jam/1425305940


Export citation