Translator Disclaimer
2014 General Vertex-Distinguishing Total Coloring of Graphs
Chanjuan Liu, Enqiang Zhu
J. Appl. Math. 2014(none): 1-7 (2014). DOI: 10.1155/2014/849748

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.

Citation

Download Citation

Chanjuan Liu. Enqiang Zhu. "General Vertex-Distinguishing Total Coloring of Graphs." J. Appl. Math. 2014 1 - 7, 2014. https://doi.org/10.1155/2014/849748

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131921
MathSciNet: MR3248925
Digital Object Identifier: 10.1155/2014/849748

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
7 PAGES


SHARE
Vol.2014 • 2014
Back to Top