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?
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 ?
Keywords: circular coloring; planar graph; triangle free