中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 数学与系统科学研究院
  3. 中国科学院数学与系统科学研究院
  4. 应用数学研究所
Neighbor sum distinguishing total choosability of planar graphs

文献类型：期刊论文

作者Qu, Cunquan1; Wang, Guanghui1; Yan, Guiying2; Yu, Xiaowei1
刊名JOURNAL OF COMBINATORIAL OPTIMIZATION
出版日期2016-10-01
卷号32期号:3页码:906-916
关键词Neighbour sum distinguishing total choosability Planar graph Total coloring Discharging Combinatorial Nullstellensatz
ISSN号1382-6905
DOI10.1007/s10878-015-9911-9
英文摘要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.
资助项目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记录号WOS:000382939800016
出版者SPRINGER
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/23355]  
专题应用数学研究所
通讯作者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.

入库方式： OAI收割

来源：数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。