Edge choosability of planar graphs without small cycles

CSpace

	Edge choosability of planar graphs without small cycles
	Zhang, L; Wu, BYD
	2004-06-06
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	283 期号:1-3 页码:289-293
摘要	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.
关键词	planar graph cycle edge choosability
DOI	10.1016/j.disc.2004.01.001
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000221901100034
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/19709
专题	中国科学院数学与系统科学研究院
通讯作者	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.