On the relaxed colouring game and the unilateral colouring game
From MaRDI portal
Publication:742610
DOI10.1007/S00373-013-1326-8zbMATH Open1298.05226OpenAlexW2001572410WikidataQ59397100 ScholiaQ59397100MaRDI QIDQ742610FDOQ742610
Authors: 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
Recommendations
2-person games (91A05) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Game chromatic number of outerplanar graphs
- Competitive colorings of oriented graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- The game coloring number of planar graphs
- A simple competitive graph coloring algorithm
- Activation strategy for asymmetric marking games
- Activation strategy for relaxed asymmetric coloring games
- Relaxed game chromatic number of graphs
- Colouring game and generalized colouring game on graphs with cut-vertices
- Generalised game colouring of graphs
- Game chromatic index of \(k\)-degenerate graphs
- Note on the game chromatic index of trees
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- A simple competitive graph coloring algorithm. II.
- Relaxed game chromatic number of trees and outerplanar graphs
- A simple competitive graph coloring algorithm. III
- Title not available (Why is that?)
- The relaxed game chromatic index of \(k\)-degenerate graphs
- The 6-relaxed game chromatic number of outerplanar graphs
Cited In (5)
This page was built for publication: On the relaxed colouring game and the unilateral colouring game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742610)
