Answers are grounded in this paper and cite their sources.
This note proves that the game chromatic number of an outerplanar graph is at most 7. This improves the previous known upper bound of the game chromatic number of outerplanar graphs.
No takes yet. Share an insight, caveat, or question.
Guan et al. (1999) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: