Refined activation strategy for the marking game

DOI10.1016/J.JCTB.2007.04.004MaRDI QIDQ2464148zbMATH OpenOpenAlexFDO

Authors Xuding Zhu

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

zbMATH Keywords

activation strategygame chromatic numbergame colouring numberplanar graphrefined activation strategy

Mathematics Subject Classification ID

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

Recommendations

• Activation strategy for asymmetric marking games
• Activation strategy for relaxed asymmetric coloring games
• scientific article; zbMATH DE number 3441890
• Determining the optimal strategies for antagonistic positional games in Markov decision processes
• Variations on a game of Gale. II: Markov strategies
• scientific article; zbMATH DE number 440593
• scientific article; zbMATH DE number 3880480
• Marking Games
• Optimal Markov strategies
• Markov interactions in a class of dynamic games

Cites work

• A bound for the game chromatic number of graphs
• A simple competitive graph coloring algorithm
• A simple competitive graph coloring algorithm. III
• Competitive colorings of oriented graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Game chromatic index of \(k\)-degenerate graphs
• Game chromatic number of outerplanar graphs
• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• scientific article; zbMATH DE number 5194465 (Why is no real title available?)
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Marking games and the oriented game chromatic number of partial k-trees
• ON THE COMPLEXITY OF SOME COLORING GAMES
• On the oriented game chromatic number
• Radius two trees specify χ‐bounded classes
• The game coloring number of planar graphs
• The game coloring number of pseudo partial \(k\)-trees
• The Map-Coloring Game
• Very asymmetric marking games

Cited in

(64)

• 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
• Circular game chromatic number of graphs
• Game colouring of the square of graphs
• Chromatic numbers of exact distance graphs
• On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers
• The game coloring number of planar graphs with a specific girth
• The median game
• A new upper bound on the game chromatic index of graphs
• Game-perfect digraphs
• The game chromatic number and the game colouring number of classes of oriented cactuses
• The strong game colouring number of directed graphs
• The game Grundy number of graphs
• The game coloring number of planar graphs with a given girth
• The incidence game chromatic number of \((a,d)\)-decomposable graphs
• Autotopism stabilized colouring games on rook's graphs
• \textsf{PSPACE}-hardness of variants of the graph coloring game
• Game chromatic number of strong product graphs
• PSPACE-hardness of two graph coloring games
• PSPACE-completeness of two graph coloring games
• A connected version of the graph coloring game
• Uniform orderings for generalized coloring numbers
• The difference between game chromatic number and chromatic number of graphs
• On the game chromatic number of splitting graphs of path and cycle
• The orthogonal colouring game
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Weak acyclic coloring and asymmetric coloring games
• Very asymmetric marking games
• On a vertex-edge marking game on graphs
• The complexity of two colouring games
• The connected greedy coloring game
• A note on the connected game coloring number
• Efficient graph packing via game colouring
• Game coloring the Cartesian product of graphs
• Game chromatic number of graphs with locally bounded number of cycles
• Coloring games on squares of graphs
• Adapted game colouring of graphs
• The game Grundy indices of graphs
• The coloring game on planar graphs with large girth, by a result on sparse cactuses
• Colouring games based on autotopisms of Latin hyper-rectangles
• The incidence game chromatic number of paths and subgraphs of wheels
• Uniquely colorable graphs with equal chromatic and game chromatic numbers
• Vertex-edge marking score of certain triangular lattices
• Game chromatic number of toroidal grids
• Game chromatic number of toroidal grids
• The incidence game chromatic number
• Graph colorings with restricted bicolored subgraphs: II. The graph coloring game
• Decomposing planar graphs into graphs with degree restrictions
• On monotonicity in maker-breaker graph colouring games
• The game chromatic index of wheels
• Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions
• Introduction to competitive graph coloring
• On graphs with maximum difference between game chromatic number and chromatic number
• Beyond the pseudoforest strong nine dragon tree theorem
• The overfull nine dragon tree conjecture is true
• Decomposing a graph into forests
• The game chromatic number and the game colouring number of cactuses
• Note on the game colouring number of powers of graphs
• Activation strategy for asymmetric marking games
• Directed defective asymmetric graph coloring games
• Decomposition of sparse graphs, with application to game coloring number
• The 6-relaxed game chromatic number of outerplanar graphs

This page was built for publication: Refined activation strategy for the marking game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464148)