Circular Coloring and Fractional Coloring in Planar Graphs

Xiaolan Hu, Jiaao Li

We study the following Steinberg-type problem on circular coloring: for an odd integer $k\ge 3$, what is the smallest number $f(k)$ such that every planar graph of girth $k$ withou…