8-star-choosability of a Graph with Maximum Average Degree Less than 3

@article{Chen20118starchoosabilityOA,
  title={8-star-choosability of a Graph with Maximum Average Degree Less than 3},
  author={Min Chen and Andr{\'e} Raspaud and Wei-Fan Wang},
  journal={Discrete Mathematics & Theoretical Computer Science},
  year={2011},
  volume={13},
  pages={97-110}
}
A proper vertex coloring of a graphG is called a star-coloring if there is no path on four vertices assigned to two colors. The graph G is L-star-colorable if for a given list assignment L there is a star-coloring c such that c(v) ∈ L(v). If G is L-star-colorable for any list assignment L with |L(v)| ≥ k for all v ∈ V (G), then G is called k-star-choosable. The star list chromatic number of G, denoted by χs(G), is the smallest integer k such that G is k-star-choosable.