A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The 6-relaxed game chromatic number of outerplanar graphs
2008
Discrete Mathematics
Suppose G is a graph and k, d are integers. The (k, d)-relaxed colouring game on G is a game played by two players, Alice and Bob, who take turns colouring the vertices of G with legal colours from a set X of k colours. Here a colour i is legal for an uncoloured vertex x if after colouring x with colour i, the subgraph induced by vertices of colour i has maximum degree at most d. Alice's goal is to have all the vertices coloured, and Bob's goal is the opposite: to have an uncoloured vertex
doi:10.1016/j.disc.2007.11.015
fatcat:xm5pe667jbdrrlvfemmeznrmji