Learn More
We introduce a coloring game on graphs, in which each vertex v of a graph G owns a stack of lv−1 erasers. In each round of this game the first player Mr. Paint takes an unused color, and colors some(More)