43 search results - page 1 / 9 » The game chromatic number of random graphs |
RSA
2008
13 years 10 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
ENDM
2006
13 years 10 months ago
2006
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
ENDM
2007
13 years 10 months ago
2007
We find exact values for the game chromatic number of the Cartesian product graphs Sm Pn, Sm Cn, P2 Wn, and P2 Km,n. This extends previous results of Bartnicki et al. on the game...
JCT
2008
13 years 10 months ago
2008
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
JGT
2008
13 years 10 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....