𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Game chromatic number of toroidal grids

✍ Scribed by Andre Raspaud; Jiaojiao Wu

Book ID
108154662
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
270 KB
Volume
109
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the oriented chromatic number of grid
On the oriented chromatic number of grids
✍ Guillaume Fertin; AndrΓ© Raspaud; Arup Roychowdhury πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 111 KB

In this paper, we focus on the oriented coloring of graphs. Oriented coloring is a coloring of the vertices of an oriented graph G without symmetric arcs such that (i) no two neighbors in G are assigned the same color, and (ii) if two vertices u and v such that (u, v) ∈ A(G) are assigned colors c(u)

A New Game Chromatic Number
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

The incidence game chromatic number
The incidence game chromatic number
✍ Stephan Dominique Andres πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 535 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.