Mr. Paint and Mrs. Correct (Q2380232)

The referred paper deals with the game theoretical approach to the coloring problem and its analysis. A new concept of the l-paintability slightly generalizing the classical notion of l-list colorability is introduced and its properties are investigated. The generalization consists namely in the existence of a stack of erasers being individual for each vertex. The colorability problem is solved by means of a 2-players game where one of the players disposes with colors, and the other one disposes with erasers. A condition for the existence of winning strategy for the erasing player is shown, and the main part of results regards the validity of the classical results on the paintability problem for the modified model.