The incidence game chromatic number

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 maximum degree , the upper bound 2 + 4k - 2 for the incidence game chromatic number is given. If 5k, we improve this bound to the

• Type: Journal
• Year: 2006
• Where: ENDM
• Authors: Stephan Dominique Andres
• Keywords: ENDM 2006, Game Chromatic Number, Incidence Game, Undirected Graph