The game coloring number of planar graphs with a given girth

DOI10.1016/j.disc.2014.04.011zbMath1295.05156OpenAlexW2097379193MaRDI QIDQ2017053

Yosuke Sekiguchi

Publication date: 25 June 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.04.011

zbMATH Keywords

girthplanar graphgame chromatic numbergame coloring number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (7)

PSPACE-hardness of two graph coloring games ⋮ On indicated coloring of lexicographic product of graphs ⋮ PSPACE-completeness of two graph coloring games ⋮ On monotonicity in maker-breaker graph colouring games ⋮ The game coloring number of planar graphs with a specific girth ⋮ On indicated coloring of some classes of graphs ⋮ \textsf{PSPACE}-hardness of variants of the graph coloring game

Cites Work

• Unnamed Item
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• The game coloring number of pseudo partial \(k\)-trees
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Refined activation strategy for the marking game
• Very asymmetric marking games
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Decompositions of quadrangle-free planar graphs

This page was built for publication: The game coloring number of planar graphs with a given girth