Equitable list coloring of planar graphs without 4- and 6-cycles |
| |
| Authors: | Qiong Li Yuehua Bu |
| |
| Affiliation: | a Department of Mathematics, Shanghai University, Shanghai, 200444, China
b Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang, 321004, China |
| |
| Abstract: | A graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L-colorable of G such that each color appears on at most  vertices. Kostochka, Pelsmajer and West introduced this notion and conjectured that G is equitably k-choosable for k>Δ(G). We prove this for planar graphs with Δ(G)≥6 and no 4- or 6-cycles. |
| |
| Keywords: | Equitable list coloring Cycle Planar graph |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
