Generalised game colouring of graphs

DOI10.1016/J.DISC.2005.11.060zbMath1118.05030OpenAlexW2150136043MaRDI QIDQ878606

Mieczysław Borowiecki, Elżbieta Sidorowicz

Publication date: 26 April 2007

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

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

zbMATH Keywords

hereditary propertygame reducible propertyGeneralised game coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The edge coloring game on trees with the number of colors greater than the game chromatic index ⋮ On the relaxed colouring game and the unilateral colouring game

Cites Work

• Unnamed Item
• Unnamed Item
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• Relaxed game chromatic number of graphs
• Game chromatic index ofk-degenerate graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• A survey of hereditary properties of graphs
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• 25 pretty graph colouring problems
• On the oriented game chromatic number

This page was built for publication: Generalised game colouring of graphs