Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable

Xiaoyan Xu, Xuding Zhu

It was conjectured by Steinberg in 1976 that planar graphs without cycles of length 4 or 5 are 3-colorable. This conjecture attracted a substantial amount of attention and was fina…