𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Directed defective asymmetric graph coloring games

✍ Scribed by Stephan Dominique Andres

Book ID
108112825
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
603 KB
Volume
158
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Asymmetric graph coloring games
Asymmetric graph coloring games
✍ H. A. Kierstead πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 151 KB

## Abstract We introduce the (__a,b__)‐coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors __a__ vertices and Bob colors __b__ vertices. We also introduce a relat

Game coloring the Cartesian product of g
Game coloring the Cartesian product of graphs
✍ Xuding Zhu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 186 KB

## Abstract 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. If __G__^\*^ has game coloring number __m__ and __G__β€² has acyclic chromat

The Game Coloring Number of Planar Graph
The Game Coloring Number of Planar Graphs
✍ Xuding Zhu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 121 KB

This paper discusses a variation of the game chromatic number of a graph: the game coloring number. This parameter provides an upper bound for the game chromatic number of a graph. We show that the game coloring number of a planar graph is at most 19. This implies that the game chromatic number of a