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.
机构:
Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R ChinaChinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China
Cai, Leizhen
Wang, Weifan
论文数: 0引用数: 0
h-index: 0
机构:
Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R ChinaChinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China
Wang, Weifan
Zhu, Xuding
论文数: 0引用数: 0
h-index: 0
机构:
Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 804, TaiwanChinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China