? 2021 The Author(s)In the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic one, are related: our new parameter is an upper bound for the game chromatic number.
Chromatic gamesComplete multipartite graphsGame chromatic numberInfinite game chromatic number
Janczewski R.、Obszarski P.、Wroblewski B.、Turowski K.
展开 >
Department of Algorithms and System Modeling Faculty of Electronics Telecommunication and Informatics Gdańsk University of Technology
Theoretical Computer Science Department Jagiellonian University
NSTL
Elsevier
