The game coloring number of planar graphs with a specific girth

DOI10.1007/s00373-018-1877-9zbMath1390.05146OpenAlexW2790307852MaRDI QIDQ1743687

Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit

Publication date: 13 April 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1877-9

zbMATH Keywords

girthplanar graphgame chromatic numbergame coloring number

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) 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 (4)

PSPACE-hardness of two graph coloring games ⋮ PSPACE-completeness of two graph coloring games ⋮ On monotonicity in maker-breaker graph colouring games ⋮ \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
• The game coloring number of planar graphs with a given girth
• 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 specific girth