Note on the game colouring number of powers of graphs
type: Item
instance of: scholarly article
title: Note on the game colouring number of powers of graphs
zbMATH Open document ID: 1329.05100
author: Stephan Dominique Andres
author: Andrea Theuser
publication date: 2016-01-26T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6535844
zbMATH Keywords: game colouring number
zbMATH Keywords: marking game
zbMATH Keywords: graph power
zbMATH Keywords: game chromatic number
zbMATH Keywords: forest
MaRDI profile type: Publication
full work available at URL: dmgt.1841
OpenAlex ID: W2578835255
cites work: Coloring Powers of Planar Graphs
cites work: The Map-Coloring Game
cites work: ON THE COMPLEXITY OF SOME COLORING GAMES
cites work: A bound for the game chromatic number of graphs
cites work: On chromatic number of graphs and set-systems
cites work: Game colouring of the square of graphs
cites work: Q4201568
cites work: A simple competitive graph coloring algorithm
cites work: Radius two trees specify χ‐bounded classes
cites work: Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
cites work: Coloring games on squares of graphs
cites work: The game coloring number of planar graphs
cites work: The game coloring number of pseudo partial \(k\)-trees
cites work: Refined activation strategy for the marking game
DOI: 10.7151/DMGT.1841
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 6535844