The relaxed game chromatic number of graphs with cut-vertices

DOI10.1007/s00373-014-1522-1zbMath1328.05069OpenAlexW2081255784MaRDI QIDQ897291

Elżbieta Sidorowicz

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1522-1

zbMATH Keywords

colouring gamerelaxed colouring game

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On the relaxed colouring game and the unilateral colouring game
• The relaxed game chromatic index of \(k\)-degenerate graphs
• A simple competitive graph coloring algorithm. II.
• Relaxed game chromatic number of trees and outerplanar graphs
• Relaxed game chromatic number of graphs
• A simple competitive graph coloring algorithm. III
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• Colouring game and generalized colouring game on graphs with cut-vertices
• Game chromatic number of outerplanar graphs