Coloring games on squares of graphs

DOI10.1016/j.disc.2012.01.004zbMath1241.05093OpenAlexW1990620363MaRDI QIDQ408174

Daqing Yang

Publication date: 29 March 2012

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

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

zbMATH Keywords

planar graphpartial \(k\)-treeasymmetric coloring gamedistance-2 coloringgame coloring

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

On coloring numbers of graph powers ⋮ Note on the game colouring number of powers of graphs

Cites Work

• Unnamed Item
• Activation strategy for asymmetric marking games
• Relaxed very asymmetric coloring games
• Activation strategy for relaxed asymmetric coloring games
• Game colouring of the square of graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• Orderings on graphs and game coloring number
• Refined activation strategy for the marking game
• Asymmetric marking games on line graphs
• Weak acyclic coloring and asymmetric coloring games
• Very asymmetric marking games
• On the degrees of the vertices of a directed graph
• Asymmetric graph coloring games
• The Map-Coloring Game

This page was built for publication: Coloring games on squares of graphs