CORC  > 山东大学
Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs
Yao, Jingjing; Yu, Xiaowei; Wang, Guanghui; Xu, Changqing
刊名GRAPHS AND COMBINATORICS
2016
卷号32期号:4页码:1611-1620
关键词Neighbor sum (set) distinguishing total coloring Adjacent vertex distinguishing total coloring d-Degenerate graph List total coloring Combinatorial Nullstellensatz
DOI10.1007/s00373-015-1646-y
URL标识查看原文
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/4709646
专题山东大学
作者单位1.Hebei Univ Technol, Sch Sci, Tianjin 300401, Peoples R China.
2.Shandong Univ, Sch Math,
推荐引用方式
GB/T 7714
Yao, Jingjing,Yu, Xiaowei,Wang, Guanghui,et al. Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs[J]. GRAPHS AND COMBINATORICS,2016,32(4):1611-1620.
APA Yao, Jingjing,Yu, Xiaowei,Wang, Guanghui,&Xu, Changqing.(2016).Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs.GRAPHS AND COMBINATORICS,32(4),1611-1620.
MLA Yao, Jingjing,et al."Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs".GRAPHS AND COMBINATORICS 32.4(2016):1611-1620.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


©版权所有 ©2017 CSpace - Powered by CSpace