Abstract
A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eight colors to star color.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1-10 |
| Number of pages | 10 |
| Journal | Journal of Graph Theory |
| Volume | 60 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2009 |
Keywords
- Planar graphs
- Star coloring
ASJC Scopus subject areas
- Geometry and Topology