Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles

Aijun Dong, Jianliang Wu

A graph $G$ is equitably $k$-choosable if, for any given $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\lceil \frac{|V(G)|}{k}\rceil$ vert…