Colouring game and generalized colouring game on graphs with cut-vertices
Elżbieta Sidorowicz · Discussiones Mathematicae Graph Theory · 2010
For k ≥ 2 we define a class of graphs H k = {G : every block of G has at most k vertices}.The class H k contains among other graphs forests, Husimi trees, line graphs of forests, cactus graphs.We consider the colouring game and the generalized colouring game on graphs from H k .