General Vertex-Distinguishing Total Coloring of Graphs

CORC > 北京大学 > 信息科学技术学院

	General Vertex-Distinguishing Total Coloring of Graphs
	Liu, Chanjuan ; Zhu, Enqiang
刊名	journal of applied mathematics
	2014
关键词	TOTAL CHROMATIC-NUMBERS EDGE AVDTC
DOI	10.1155/2014/849748
英文摘要	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.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000343547000001&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Mathematics, Applied; SCI(E); 0; ARTICLE; zhuenqiang@163.com
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/291663]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Liu, Chanjuan,Zhu, Enqiang. General Vertex-Distinguishing Total Coloring of Graphs[J]. journal of applied mathematics,2014.
APA	Liu, Chanjuan,&Zhu, Enqiang.(2014).General Vertex-Distinguishing Total Coloring of Graphs.journal of applied mathematics.
MLA	Liu, Chanjuan,et al."General Vertex-Distinguishing Total Coloring of Graphs".journal of applied mathematics (2014).