Neighbor sum distinguishing total choosability of planar graphs

doi:10.1007/s10878-015-9911-9

CSpace > 应用数学研究所

	Neighbor sum distinguishing total choosability of planar graphs
	Qu, Cunquan 1; Wang, Guanghui 1; Yan, Guiying2 ; Yu, Xiaowei 1
	2016-10-01
发表期刊	JOURNAL OF COMBINATORIAL OPTIMIZATION
ISSN	1382-6905
卷号	32 期号:3 页码:906-916
摘要	A total-k-coloring of a graph G is a mapping such that any two adjacent or incident elements in receive different colors. For a total-k-coloring of G, let denote the total sum of colors of the edges incident with v and the color of v. If for each edge , , then we call such a total-k-coloring neighbor sum distinguishing. The least number k needed for such a coloring of G is the neighbor sum distinguishing total chromatic number, denoted by . PilA > niak and WoA(0)niak conjectured for any simple graph with maximum degree . In this paper, we prove that for any planar graph G with maximum degree , , where is the neighbor sum distinguishing total choosability of G.
关键词	Neighbour sum distinguishing total choosability Planar graph Total coloring Discharging Combinatorial Nullstellensatz
DOI	10.1007/s10878-015-9911-9
语种	英语
资助项目	National Natural Science Foundation of China[11101243] ; National Natural Science Foundation of China[11371355] ; National Natural Science Foundation of China[11471193] ; Fundamental Research Funds of Shandong University ; Independent Innovation Foundation of Shandong University[IFYT14012]
WOS研究方向	Computer Science ; Mathematics
WOS类目	Computer Science, Interdisciplinary Applications ; Mathematics, Applied
WOS记录号	WOS:000382939800016
出版者	SPRINGER
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/23356
专题	应用数学研究所
通讯作者	Wang, Guanghui
作者单位	1.Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 10080, Peoples R China
推荐引用方式 GB/T 7714	Qu, Cunquan,Wang, Guanghui,Yan, Guiying,et al. Neighbor sum distinguishing total choosability of planar graphs[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2016,32(3):906-916.
APA	Qu, Cunquan,Wang, Guanghui,Yan, Guiying,&Yu, Xiaowei.(2016).Neighbor sum distinguishing total choosability of planar graphs.JOURNAL OF COMBINATORIAL OPTIMIZATION,32(3),906-916.
MLA	Qu, Cunquan,et al."Neighbor sum distinguishing total choosability of planar graphs".JOURNAL OF COMBINATORIAL OPTIMIZATION 32.3(2016):906-916.