|
|||||
|
|
Edge choosability of planar graphs without short cycles |
|
| Authors: | Weifan?Wang mailto:wwf@zjnu.cn" title=" wwf@zjnu.cn" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author |
| Affiliation: | School of Mathematics and Physics, Zhejiang Normal University, Jinhua 321004, China |
| Abstract: | In this paper we prove that ifG is a planar graph with Δ = 5 and without 4-cycles or 6-cycles, thenG is edge-6-choosable. This consequence together with known results show that, for each fixedk Є {3,4,5,6}, ak-cycle-free planar graphG is edge-(Δ + 1)-choosable, where Δ denotes the maximum degree ofG. |
| Keywords: | planar graph coloring choosability cycle. |
| 本文献已被 CNKI 万方数据 SpringerLink 等数据库收录！ | |