QQ客服 官方微博 反馈留言

	Total coloring of planar graphs without adjacent short cycles (EI收录)
	Wang, Huijuan[1]; Liu, Bin[2]; Gu, Yan[1]; Zhang, Xin[3]; Wu, Weili[4,5]; Gao, Hongwei[1]
刊名	Journal of Combinatorial Optimization
	2017
卷号	33页码:265-274
关键词	Coloring Graphic methods
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2185108
专题	华南理工大学
作者单位	1.[1] College of Mathematics, Qingdao University, Qingdao 2.266071, China 3.[2] Department of Mathematics, Ocean University of China, Qingdao 4.266100, China 5.[3] School of Mathematics and Statistics, Xidian University, Xi’an 6.710071, China 7.[4] College of Computer Science and Technology, TaiYuan University of Technology, Taiyuan 8.030024, China 9.[5] Department of Computer Science, University of Texas at Dallas, Richardson 10.TX
推荐引用方式 GB/T 7714	Wang, Huijuan[1],Liu, Bin[2],Gu, Yan[1],等. Total coloring of planar graphs without adjacent short cycles (EI收录)[J]. Journal of Combinatorial Optimization,2017,33:265-274.
APA	Wang, Huijuan[1],Liu, Bin[2],Gu, Yan[1],Zhang, Xin[3],Wu, Weili[4,5],&Gao, Hongwei[1].(2017).Total coloring of planar graphs without adjacent short cycles (EI收录).Journal of Combinatorial Optimization,33,265-274.
MLA	Wang, Huijuan[1],et al."Total coloring of planar graphs without adjacent short cycles (EI收录)".Journal of Combinatorial Optimization 33(2017):265-274.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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