The incidence game chromatic number
Andres, Dominique
(2009)
The incidence game chromatic number.
Published in:
Discrete Applied Mathematics Vol. 157 (9).
pp. 1980-1987.
Abstract
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For k-degenerate graphs with maximum degree D, the upper bound 2D+4k-2 for the incidence game chromatic number is given. If D is at least 5k, we improve this bound to the value 2D+3k-1. We also determine the exact incidence game chromatic number of cycles, stars and sufficiently large wheels and obtain the lower bound 3D/2 for the incidence game chromatic number of graphs of maximum degree D.
Actions:
Download: |
Download (308kB) | Preview |
---|---|
Download: |
Download (138kB) | Preview |
Editorial actions: | ![]() |
Content information:
Deposit Information:
ZAIK Number: | zaik2007-565 |
---|---|
Depositing User: | Dominique Andres |
Date Deposited: | 04 Dec 2007 00:00 |
Last Modified: | 19 Dec 2011 09:44 |
URI: | http://e-archive.informatik.uni-koeln.de/id/eprint/565 |