Abstract
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and hence the game chromatic number of G, is at most 17.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have