Note On The Game Colouring Number Of Powers Of Graphs
We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the game colouring number of the underlying graph. F...
Main Authors: | Andres Stephan Dominique, Theuser Andrea |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2016-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1841 |
Similar Items
-
A Note on the Thue Chromatic Number of Lexicographic Products of Graphs
by: Peterin Iztok, et al.
Published: (2018-08-01) -
Chromatic Properties of the Pancake Graphs
by: Konstantinova Elena
Published: (2017-08-01) -
On Generalized Sierpiński Graphs
by: Rodríguez-Velázquez Juan Alberto, et al.
Published: (2017-08-01) -
Independence Number and Packing Coloring of Generalized Mycielski Graphs
by: Bidine Ez Zobair, et al.
Published: (2021-08-01) -
The Hanoi Graph H43
by: Hinz Andreas M., et al.
Published: (2020-11-01)