The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles | |
Sun, Lin; Cheng, Xiaohan; Wu, Jianliang | |
刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
![]() |
2017 | |
卷号 | 33期号:2页码:779-790 |
关键词 | Planar graph Adjacent vertex distinguishing total coloring Combinatorial Nullstellensatz Discharging method |
DOI | 10.1007/s10878-016-0004-1 |
URL标识 | 查看原文 |
公开日期 | [db:dc_date_available] |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/4590517 |
专题 | 山东大学 |
作者单位 | 1.Changji Univ, Dept Math, Changji 831100, Peoples R China. 2.Shandong Univ, Sch Math, Jinan 25010 |
推荐引用方式 GB/T 7714 | Sun, Lin,Cheng, Xiaohan,Wu, Jianliang. The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2017,33(2):779-790. |
APA | Sun, Lin,Cheng, Xiaohan,&Wu, Jianliang.(2017).The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles.JOURNAL OF COMBINATORIAL OPTIMIZATION,33(2),779-790. |
MLA | Sun, Lin,et al."The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles".JOURNAL OF COMBINATORIAL OPTIMIZATION 33.2(2017):779-790. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论