pith. sign in

arxiv: 1410.5223 · v1 · pith:CVUBKQQXnew · submitted 2014-10-20 · 🧮 math.CO

The game chromatic number of trees and forests

classification 🧮 math.CO
keywords chromaticgamenumberforestforestscriteriadegreedetermining
0
0 comments X
read the original abstract

While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary and sufficient conditions for forests with game chromatic number 2 and then investigate the differences between forests with game chromatic number 3 and 4. In doing so, we present a minimal example of a forest with game chromatic number 4, criteria for determining the game chromatic number of a forest without vertices of degree 3, and an example of a forest with maximum degree 3 and game chromatic number 4.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.