中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Edge choosability of planar graphs without small cycles

文献类型:期刊论文

作者Zhang, L; Wu, BYD
刊名DISCRETE MATHEMATICS
出版日期2004-06-06
卷号283期号:1-3页码:289-293
关键词planar graph cycle edge choosability
ISSN号0012-365X
DOI10.1016/j.disc.2004.01.001
英文摘要We 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.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000221901100034
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/19708]  
专题中国科学院数学与系统科学研究院
通讯作者Zhang, L
作者单位Chinese Acad Sci, Graph Theory & Combinator Lab, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
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.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

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