✦ LIBER ✦

The incidence game chromatic number

✍ Scribed by Stephan Dominique Andres

Book ID: 108112724
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 535 KB
Volume: 157
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.10.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Game Chromatic Number

✍ G. Chen; R.H. Schelp; W.E. Shreve 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Consider the following two-person game on a graph G . Players I and II move alternatively to color a yet uncolored vertex of G properly using a pre-specified set of colors . Furthermore , Player II can only use the colors that have been used , unless he is forced to use a new color to guarantee that

Game chromatic number of toroidal grids

✍ Andre Raspaud; Jiaojiao Wu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 270 KB

Game chromatic number of outerplanar gra

Game chromatic number of outerplanar graphs

✍ Guan, D. J.; Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

This note proves that the game chromatic number of an outerplanar graph is at most 7. This improves the previous known upper bound of the game chromatic number of outerplanar graphs.

The relaxed game chromatic number of out

The relaxed game chromatic number of outerplanar graphs

✍ Charles Dunn; Hal A. Kierstead 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract The (__r__,__d__)‐relaxed coloring game is played by two players, Alice and Bob, on a graph __G__ with a set of __r__ colors. The players take turns coloring uncolored vertices with legal colors. A color α is legal for an uncolored vertex __u__ if __u__ is adjacent to at most __d__ vert

Playing a Game to Bound the Chromatic Nu

Playing a Game to Bound the Chromatic Number

✍ Panagiota N. Panagopoulou, Paul G. Spirakis 📂 Article 📅 2012 🏛 Mathematical Association of America 🌐 English ⚖ 227 KB

A bound for the game chromatic number of

A bound for the game chromatic number of graphs

✍ Thomas Dinski; Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 580 KB

We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particula