QQ客服 官方微博 反馈留言

	Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
	Liu, Runrun*; Li, Xiangwen
刊名	DISCRETE MATHEMATICS
	2019
卷号	342期号:3页码:623-627
关键词	DP-coloring discharging planar graph
ISSN号	0012-365X
DOI	10.1016/j.disc.2018.10.025
URL标识	查看原文
WOS记录号	WOS:000457821300002
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/5160527
专题	华中师范大学
作者单位	1.[Liu, Runrun 2.Li, Xiangwen] Cent China Normal Univ, Dept Math & Stat, Wuhan 430079, Hubei, Peoples R China.
推荐引用方式 GB/T 7714	Liu, Runrun*,Li, Xiangwen. Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable[J]. DISCRETE MATHEMATICS,2019,342(3):623-627.
APA	Liu, Runrun*,&Li, Xiangwen.(2019).Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable.DISCRETE MATHEMATICS,342(3),623-627.
MLA	Liu, Runrun*,et al."Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable".DISCRETE MATHEMATICS 342.3(2019):623-627.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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