𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Game matching number of graphs

✍ Scribed by Cranston, Daniel W.; Kinnersley, William B.; O, Suil; West, Douglas B.

Book ID
120376391
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
396 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 game Grundy number of graphs
The game Grundy number of graphs
✍ FrΓ©dΓ©ric Havet, Xuding Zhu πŸ“‚ Article πŸ“… 2012 πŸ› Springer US 🌐 English βš– 469 KB
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