CSpace
A note on 3-choosability of planar graphs without certain cycles
Zhang, L; Wu, BD
2005-07-28
Source PublicationDISCRETE MATHEMATICS
ISSN0012-365X
Volume297Issue:1-3Pages:206-209
AbstractSteinberg 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.
Keywordplanar graph cycle choosability
DOI10.1016/j.disc.2005.05.001
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000231556200021
PublisherELSEVIER SCIENCE BV
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/1752
Collection中国科学院数学与系统科学研究院
Corresponding AuthorZhang, L
Affiliation1.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
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhang, L]'s Articles
[Wu, BD]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang, L]'s Articles
[Wu, BD]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang, L]'s Articles
[Wu, BD]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.