|
|||||
|
|
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable |
|
| Authors: | Yingqian Wang |
| Institution: | a College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China b College of Mathematics and Information Engineering, Jiaxing University, Jiaxing, 314001, China |
| Abstract: | It is shown that a planar graph without cycles of length 4, 5, 8, or 9 is 3-choosable. |
| Keywords: | Planar graph Cycle Choosability Colorability |
| 本文献已被 ScienceDirect 等数据库收录！ | |