Planar Graphs with Star Chromatic Number Between Three and Four
Rong‐Xia Hao · 2001
Having generalized the construction of Moser, we provide a systematic method of constructing planar graphs with a rational number r between 3 and 4 as their star chromatic number, and partially answer a problem of Vince.