![](/files/happy5.png)
Zhu, Xuding
Bounding the on-line choice number in terms of the choice number ★★
Author(s): Zhu
Question Are there graphs for which
is arbitrarily large?
![$ \text{ch}^{\text{OL}}-\text{ch} $](/files/tex/3aa1320c57f076f184f0f05f44e350d3ffea4fa4.png)
Keywords: choosability; list coloring; on-line choosability
Circular coloring triangle-free subcubic planar graphs ★★
Problem Does every triangle-free planar graph of maximum degree three have circular chromatic number at most
?
![$ \frac{20}{7} $](/files/tex/bad459acf1e14f972d8bf6c9f92912e0be945739.png)
Keywords: circular coloring; planar graph; triangle free
![Syndicate content Syndicate content](/misc/feed.png)