On the relaxed colouring game and the unilateral colouring game

DOI10.1007/s00373-013-1326-8zbMath1298.05226OpenAlexW2001572410WikidataQ59397100 ScholiaQ59397100MaRDI QIDQ742610

Elżbieta Sidorowicz

Publication date: 19 September 2014

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

Full work available at URL: https://doi.org/10.1007/s00373-013-1326-8

zbMATH Keywords

colouring gamegeneralized colouring gamerelaxed colouring game

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

The relaxed game chromatic number of graphs with cut-vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Generalised game colouring of graphs
• The relaxed game chromatic index of \(k\)-degenerate graphs
• Activation strategy for asymmetric marking games
• The 6-relaxed game chromatic number of outerplanar graphs
• Activation strategy for relaxed asymmetric coloring games
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm
• Relaxed game chromatic number of trees and outerplanar graphs
• Relaxed game chromatic number of graphs
• A simple competitive graph coloring algorithm. III
• Note on the game chromatic index of trees
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• Game chromatic index ofk-degenerate graphs
• Colouring game and generalized colouring game on graphs with cut-vertices
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Competitive colorings of oriented graphs