Edge choosability of planar graphs without small cycles

被引：23
|
作者：
Zhang, L [1 ]
Wu, BYD [1 ]
机构：
[1] Chinese Acad Sci, Graph Theory & Combinator Lab, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
来源：
DISCRETE MATHEMATICS | 2004年 / 283卷 / 1-3期
关键词：
planar graph; cycle; edge choosability;
D O I：
10.1016/j.disc.2004.01.001
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：289 / 293
页数：5
相关论文
共 50 条
12345