Jiaao Li

collaborators

2 papers

math.CO2020

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 \geq 3$ , what is the smallest number $f (k)$ such that every planar graph of girth $k$ withou…

math.CO2018

Circular Flows in Planar Graphs

Daniel W. Cranston, Jiaao Li

For integers $a \geq 2 b > 0$ , a \emph{circular $a / b$ -flow} is a flow that takes values from ${\pm b, \pm (b + 1), \dots, \pm (a - b)}$ . The Planar Circular Flow Conjecture states that ever…