The coloring game on planar graphs with large girth, by a result on sparse cactuses

DOI10.1016/j.disc.2016.08.010zbMath1357.05103arXiv1507.03195OpenAlexW2963982719MaRDI QIDQ512597

Clément Charpentier

Publication date: 27 February 2017

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

Full work available at URL: https://arxiv.org/abs/1507.03195

zbMATH Keywords

planar graphscactusesgraph coloring game

Mathematics Subject Classification ID

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 (1)

Unnamed Item

Cites Work

• Unnamed Item
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Decomposing a graph into forests
• The game chromatic number and the game colouring number of cactuses
• Decomposing a planar graph with girth 9 into a forest and a matching
• Planar graphs decomposable into a forest and a matching
• The game coloring number of planar graphs
• The game chromatic number and the game colouring number of classes of oriented cactuses
• The game coloring number of pseudo partial \(k\)-trees
• Refined activation strategy for the marking game
• The game chromatic number of trees and forests
• Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Game chromatic number of toroidal grids

This page was built for publication: The coloring game on planar graphs with large girth, by a result on sparse cactuses