Indicated coloring of graphs

DOI10.1016/j.disc.2012.07.001zbMath1252.05062OpenAlexW1985466492MaRDI QIDQ1761467

Andrzej Grzesik

Publication date: 15 November 2012

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

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

zbMATH Keywords

random graphgame chromatic numbergraph coloring gameindicated chromatic numberclique-pair conjecture

Mathematics Subject Classification ID

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

Related Items (10)

On indicated chromatic number of graphs ⋮ The independence coloring game on graphs ⋮ On indicated coloring of lexicographic product of graphs ⋮ On indicated coloring of graphs ⋮ Indicated coloring of the Mycielskian of some families of graphs ⋮ On monotonicity in maker-breaker graph colouring games ⋮ Indicated coloring game on Cartesian products of graphs ⋮ Indicated coloring of matroids ⋮ On indicated coloring of some classes of graphs ⋮ On game chromatic vertex-critical graphs

Cites Work

• The game coloring number of planar graphs
• Elementary bipartite graphs and unique colourability
• Efficient Graph Packing via Game Colouring
• ON THE COMPLEXITY OF SOME COLORING GAMES
• The Map-Coloring Game
• The game chromatic number of random graphs
• The chromatic number of random graphs
• The chromatic number of random graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Indicated coloring of graphs