CSpace
Edge choosability of planar graphs without small cycles
Zhang, L; Wu, BYD
2004-06-06
Source PublicationDISCRETE MATHEMATICS
ISSN0012-365X
Volume283Issue:1-3Pages:289-293
AbstractWe investigate structural properties of planar graphs without triangles or without 4-cycles, and show that every triangle-free planar graph G is edge-(Delta(G) + 1)-choosable and that every planar graph with A(G) not equal 5 and without 4-cycles is also edge-(Delta(G) + 1)-choosable. (C) 2003 Elsevier B.V. All rights reserved.
Keywordplanar graph cycle edge choosability
DOI10.1016/j.disc.2004.01.001
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000221901100034
PublisherELSEVIER SCIENCE BV
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/19709
Collection中国科学院数学与系统科学研究院
Corresponding AuthorZhang, L
AffiliationChinese Acad Sci, Graph Theory & Combinator Lab, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Zhang, L,Wu, BYD. Edge choosability of planar graphs without small cycles[J]. DISCRETE MATHEMATICS,2004,283(1-3):289-293.
APA Zhang, L,&Wu, BYD.(2004).Edge choosability of planar graphs without small cycles.DISCRETE MATHEMATICS,283(1-3),289-293.
MLA Zhang, L,et al."Edge choosability of planar graphs without small cycles".DISCRETE MATHEMATICS 283.1-3(2004):289-293.
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, BYD]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang, L]'s Articles
[Wu, BYD]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang, L]'s Articles
[Wu, BYD]'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.