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 |
DOI | 10.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. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论