Activation strategy for asymmetric marking games
From MaRDI portal
Publication:925014
DOI10.1016/j.ejc.2007.07.004zbMath1143.91008OpenAlexW2110779223MaRDI QIDQ925014
Publication date: 29 May 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.07.004
Related Items (8)
Asymmetric coloring games on incomparability graphs ⋮ On a vertex-edge marking game on graphs ⋮ Coloring games on squares of graphs ⋮ The strong game colouring number of directed graphs ⋮ Asymmetric marking games on line graphs ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ Activation strategy for relaxed asymmetric coloring games ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications
Cites Work
- The game coloring number of planar graphs
- A simple competitive graph coloring algorithm
- A simple competitive graph coloring algorithm. III
- The game coloring number of pseudo partial \(k\)-trees
- Refined activation strategy for the marking game
- Asymmetric marking games on line graphs
- Very asymmetric marking games
- Asymmetric graph coloring games
This page was built for publication: Activation strategy for asymmetric marking games
