𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Orderings on Graphs and Game Coloring Number

✍ Scribed by H. A. Kierstead; Daqing Yang

Book ID
111603067
Publisher
Springer Netherlands
Year
2003
Tongue
English
Weight
107 KB
Volume
20
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Edge-partitions of planar graphs and the
Edge-partitions of planar graphs and their game coloring numbers
✍ Wenjie He; Xiaoling Hou; Ko-Wei Lih; Jiating Shao; Weifan Wang; Xuding Zhu πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 98 KB πŸ‘ 1 views

Let G be a planar graph and let g(G) and Á(G) be its girth and maximum degree, respectively. We show that G has an edge-partition into a forest and a subgraph H so that (i) -cycles (though it may contain 3-cycles). These results are applied to find the following upper bounds for the game coloring n

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