The game coloring number of planar graphs with a given girth

DOI10.1016/J.DISC.2014.04.011zbMATH Open1295.05156OpenAlexW2097379193MaRDI QIDQ2017053FDOQ2017053

Authors: 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

Recommendations

• The game coloring number of planar graphs with a specific girth
• The game coloring number of planar graphs
• The coloring game on planar graphs with large girth, by a result on sparse cactuses
• Total colourings of planar graphs with large girth
• scientific article; zbMATH DE number 5670857
• Colorings and girth of oriented planar graphs
• The game chromatic and chromatic number of some graphs
• Game chromatic number of outerplanar graphs
• Edge-partitions of planar graphs and their game coloring numbers
• scientific article; zbMATH DE number 398953

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)

Cites Work

• Title not available (Why is that?)
• Game chromatic number of outerplanar graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• 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
• Edge-partitions of planar graphs and their game coloring numbers
• Decompositions of quadrangle-free planar graphs
• Decomposing a planar graph with girth at least 8 into a forest and a matching

Cited In (10)

• The game coloring number of planar graphs with a specific girth
• Edge-partitions of planar graphs and their game coloring numbers
• On indicated coloring of lexicographic product of graphs
• On monotonicity in maker-breaker graph colouring games
• On graphs with maximum difference between game chromatic number and chromatic number
• \textsf{PSPACE}-hardness of variants of the graph coloring game
• PSPACE-hardness of two graph coloring games
• The coloring game on planar graphs with large girth, by a result on sparse cactuses
• PSPACE-completeness of two graph coloring games
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017053)