The Game Chromatic Number of Complete Multipartite Graphs with No Singletons
From MaRDI portal
Abstract: In this paper we investigate the game chromatic number for complete multipartite graphs. We devise several strategies for Alice, and one strategy for Bob, and we prove their optimality in all complete multipartite graphs with no singletons. All the strategies presented are computable in linear time, and the values of the game chromatic number depend directly only on the number and the sizes of sets in the partition.
This page was built for publication: The Game Chromatic Number of Complete Multipartite Graphs with No Singletons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6434108)
