Geodesic
Colouring game and generalized colouring game on graphs with cut-vertices
Discussiones Mathematicae. Graph Theory, Tome 30 (2010) no. 3, pp. 499-533

Voir la notice de l'article provenant de la source Library of Science

For k ≥ 2 we define a class of graphs ₖ = G: every block of G has at most k vertices. The class ₖ 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 ₖ.
Keywords: colouring game, generalized colouring game 
@article{DMGT_2010_30_3_a11,
     author = {Sidorowicz, El\.zbieta},
     title = {Colouring game and generalized colouring game on graphs with cut-vertices},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {499--533},
     publisher = {mathdoc},
     volume = {30},
     number = {3},
     year = {2010},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2010_30_3_a11/}
}
TY  - JOUR
AU  - Sidorowicz, Elżbieta
TI  - Colouring game and generalized colouring game on graphs with cut-vertices
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2010
SP  - 499
EP  - 533
VL  - 30
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2010_30_3_a11/
LA  - en
ID  - DMGT_2010_30_3_a11
ER  - 
%0 Journal Article
%A Sidorowicz, Elżbieta
%T Colouring game and generalized colouring game on graphs with cut-vertices
%J Discussiones Mathematicae. Graph Theory
%D 2010
%P 499-533
%V 30
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2010_30_3_a11/
%G en
%F DMGT_2010_30_3_a11
Sidorowicz, Elżbieta. Colouring game and generalized colouring game on graphs with cut-vertices. Discussiones Mathematicae. Graph Theory, Tome 30 (2010) no. 3, pp. 499-533. http://geodesic.mathdoc.fr/item/DMGT_2010_30_3_a11/