Abstract
The graph coloring game on a graph G is a two-player game. In the game, the players alternately color an uncolored vertex of G by a color in a given color set X so that any two adjacent vertices receive different colors. The first player's aim is to completely color all vertices of G only by using colors in X, and the second player's aim is to avoid it. The game chromatic number of a graph G, denoted by χg(G), is the minimum number of colors such that the first player has a winning strategy for the graph coloring game on G. In this paper, we prove that for any simple graph G, χg(G)−χ(G)≤⌊n2⌋−1, where χ(G) is the chromatic number of G. Moreover, the estimation is best possible since there exist graphs with even order attaining the equality.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.