Abstract
This paper discusses a coloring game on graphs. Let k,d be non-negative integers and C a set of k colors. Two persons, Alice and Bob, alternately color the vertices of G with colors from C, with Alice having the first move. A color i is legal for an uncolored vertex x if by coloring x with color i, the subgraph of G induced by those vertices of color i has maximum degree at most d. Each move of Alice or Bob colors an uncolored vertex with a legal color. The game is over if either all vertices are colored, or no more vertices can be colored with a legal color. Alice's goal is to produce a legal coloring which colors all the vertices of G, and Bob's goal is to prevent this from happening. We shall prove that if G is a forest, then for k=3,d⩾1, Alice has a winning strategy. If G is an outerplanar graph, then for k=6 and d⩾1, Alice has a winning strategy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
