Majority coloring game
Bartłomiej Bosek , Jarosław Grytczuk , Gabriel Jakóbczak
AbstractA majority coloring of a graph is a coloring of its vertices such that for each vertex , at least half of the neighbors of have different color than . Let denote the least number of colors needed for a majority coloring of a graph . It is well known and easy to prove that for every graph . We consider a game-theoretic variant of this parameter, the majority game chromatic number , defined via a two person coloring game in which one of the players tries to produce a majority coloring of the whole graph, while the other tends to prevent it. We prove that is in general unbounded. On the other hand, it is not hard to see that is not greater than , the game coloring number of . We improve this trivial bound for some classes of graphs. In particular, we prove that for every complete binary tree . This may suggest that is bounded for graphs with bounded coloring number . However, we prove that, contrary to this intuition, is unbounded for graphs with .
|Journal series||Discrete Applied Mathematics, ISSN 0166-218X, (A 25 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||Game chromatic number; Majority coloring; Majority game chromatic number|
|Score||= 25.0, 05-06-2019, ArticleFromJournal|
|Publication indicators||: 2016 = 1.17; : 2017 = 0.932 (2) - 2017=1.008 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.