Refined activation strategy for the marking game
From MaRDI portal
Publication:2464148
DOI10.1016/j.jctb.2007.04.004zbMath1127.05047OpenAlexW2144293155MaRDI QIDQ2464148
Publication date: 10 December 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.04.004
planar graphgame chromatic numbergame colouring numberactivation strategyrefined activation strategy
Related Items (59)
PSPACE-hardness of two graph coloring games ⋮ Chromatic numbers of exact distance graphs ⋮ The game chromatic number and the game colouring number of cactuses ⋮ Asymmetric coloring games on incomparability graphs ⋮ On a vertex-edge marking game on graphs ⋮ PSPACE-completeness of two graph coloring games ⋮ Game-perfect digraphs ⋮ Graph colorings with restricted bicolored subgraphs: II. The graph coloring game ⋮ Decomposing planar graphs into graphs with degree restrictions ⋮ Game chromatic number of graphs with locally bounded number of cycles ⋮ Coloring games on squares of graphs ⋮ A connected version of the graph coloring game ⋮ Adapted game colouring of graphs ⋮ Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs ⋮ The game chromatic number and the game colouring number of classes of oriented cactuses ⋮ The strong game colouring number of directed graphs ⋮ On monotonicity in maker-breaker graph colouring games ⋮ Note on the game colouring number of powers of graphs ⋮ The complexity of two colouring games ⋮ The connected greedy coloring game ⋮ A note on the connected game coloring number ⋮ The game chromatic index of wheels ⋮ The game Grundy number of graphs ⋮ Activation strategy for asymmetric marking games ⋮ Uniform orderings for generalized coloring numbers ⋮ On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers ⋮ Efficient Graph Packing via Game Colouring ⋮ Game chromatic number of toroidal grids ⋮ The game Grundy indices of graphs ⋮ The game coloring number of planar graphs with a specific girth ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ The median game ⋮ Game chromatic number of toroidal grids ⋮ A new upper bound on the game chromatic index of graphs ⋮ The incidence game chromatic number ⋮ The incidence game chromatic number of paths and subgraphs of wheels ⋮ Directed defective asymmetric graph coloring games ⋮ Decomposition of sparse graphs, with application to game coloring number ⋮ Weak acyclic coloring and asymmetric coloring games ⋮ Very asymmetric marking games ⋮ The game coloring number of planar graphs with a given girth ⋮ The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ The difference between game chromatic number and chromatic number of graphs ⋮ Autotopism stabilized colouring games on rook's graphs ⋮ Game coloring the Cartesian product of graphs ⋮ Colouring games based on autotopisms of Latin hyper-rectangles ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ Game-perfect graphs ⋮ Lightness of digraphs in surfaces and directed game chromatic number ⋮ Colouring games on outerplanar graphs and trees ⋮ Activation strategy for relaxed asymmetric coloring games ⋮ Decomposing a graph into forests ⋮ \textsf{PSPACE}-hardness of variants of the graph coloring game ⋮ Circular game chromatic number of graphs ⋮ Game colouring of the square of graphs ⋮ On the game chromatic number of splitting graphs of path and cycle ⋮ The orthogonal colouring game ⋮ Game chromatic number of strong product graphs ⋮ Uniquely colorable graphs with equal chromatic and game chromatic numbers
Cites Work
- Unnamed Item
- Unnamed Item
- A bound for the game chromatic number of graphs
- The game coloring number of planar graphs
- Marking games and the oriented game chromatic number of partial \(k\)-trees
- A simple competitive graph coloring algorithm
- A simple competitive graph coloring algorithm. III
- The game coloring number of pseudo partial \(k\)-trees
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
- Very asymmetric marking games
- Game chromatic index ofk-degenerate graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Game chromatic number of outerplanar graphs
- Radius two trees specify χ‐bounded classes
- Edge-partitions of planar graphs and their game coloring numbers
- The Map-Coloring Game
- Competitive colorings of oriented graphs
- On the oriented game chromatic number
This page was built for publication: Refined activation strategy for the marking game
