Choosability and edge choosability of planar graphs without five cycles

被引：88
作者：
Wang, WF [1 ]
Lih, KW
机构：
[1] Liaoning Univ, Dept Math, Shenyang 110036, Peoples R China
[2] Acad Sinica, Inst Math, Taipei 115, Taiwan
来源：
APPLIED MATHEMATICS LETTERS | 2002年 / 15卷 / 05期
关键词：
choosability; edge choosability; degeneracy; planar graph;
D O I：
10.1016/S0893-9659(02)80007-6
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(Delta(G)+1)-choosable. (C) 2002 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：561 / 565
页数：5
相关论文
共 4 条
1