A note on 3-choosability of planar graphs without certain cycles

doi:10.1016/j.disc.2005.05.001

CSpace

	A note on 3-choosability of planar graphs without certain cycles
	Zhang, L ; Wu, BD
	2005-07-28
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	297 期号:1-3 页码:206-209
摘要	Steinberg asked whether every planar graph without 4 and 5 cycles is 3-colorable. Borodin, and independently Sanders and Zhao, showed that every planar graph without any cycle of length between 4 and 9 is 3-colorable. We improve this result by showing that every planar graph without any cycle of length 4, 5, 6, or 9 is 3-choosable. (c) 2005 Elsevier B.V. All rights reserved.
关键词	planar graph cycle choosability
DOI	10.1016/j.disc.2005.05.001
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000231556200021
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/1752
专题	中国科学院数学与系统科学研究院
通讯作者	Zhang, L
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China 2.Xinjiang Univ Urumqi, Coll Math & Syst Sci, Xinjiang 830046, Peoples R China
推荐引用方式 GB/T 7714	Zhang, L,Wu, BD. A note on 3-choosability of planar graphs without certain cycles[J]. DISCRETE MATHEMATICS,2005,297(1-3):206-209.
APA	Zhang, L,&Wu, BD.(2005).A note on 3-choosability of planar graphs without certain cycles.DISCRETE MATHEMATICS,297(1-3),206-209.
MLA	Zhang, L,et al."A note on 3-choosability of planar graphs without certain cycles".DISCRETE MATHEMATICS 297.1-3(2005):206-209.