Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable |
| |
| Authors: | Yingqian Wang Qian WuLiang Shen |
| |
| Affiliation: | College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Zhejiang Jinhua 321004, China |
| |
| Abstract: | ![]()
It is known that planar graphs without cycles of length 4, i, j, or 9 with 4<i<j<9, except that i=7 and j=8, are 3-choosable. This paper proves that planar graphs without cycles of length 4, 7, 8, or 9 are also 3-choosable. |
| |
| Keywords: | Planar graph Cycle Choosability Coloring |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
