๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The game coloring number of planar graphs with a given girth

โœ Scribed by Sekiguchi, Yosuke

Book ID
123267391
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
377 KB
Volume
330
Category
Article
ISSN
0012-365X

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

(2 + ?)-Coloring of planar graphs with l
(2 + ?)-Coloring of planar graphs with large odd-girth
โœ Klostermeyer, William; Zhang, Cun Quan ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 258 KB ๐Ÿ‘ 3 views

The odd-girth of a graph is the length of a shortest odd circuit. A conjecture by Pavol Hell about circular coloring is solved in this article by showing that there is a function f ( ) for each : 0 < < 1 such that, if the odd-girth of a planar graph G is at least f ( ), then G is (2 + )-colorable. N