Activation strategy for asymmetric marking games

DOI10.1016/J.EJC.2007.07.004MaRDI QIDQ925014zbMATH OpenOpenAlexFDO

Authors Daqing Yang, Xuding Zhu

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

zbMATH Keywords

activation strategychordal graphmarking games

Mathematics Subject Classification ID

Games involving graphs (91A43)

Recommendations

• Refined activation strategy for the marking game
• Activation strategy for relaxed asymmetric coloring games
• Asymmetric graph coloring games
• Very asymmetric marking games
• Asymmetric marking games on line graphs

Cites work

• A simple competitive graph coloring algorithm
• A simple competitive graph coloring algorithm. III
• Asymmetric graph coloring games
• Asymmetric marking games on line graphs
• Refined activation strategy for the marking game
• The game coloring number of planar graphs
• The game coloring number of pseudo partial \(k\)-trees
• Very asymmetric marking games

Cited in

(8)

• Activation strategy for relaxed asymmetric coloring games
• Generalization of transitive fraternal augmentations for directed graphs and its applications
• The strong game colouring number of directed graphs
• Refined activation strategy for the marking game
• Asymmetric marking games on line graphs
• On a vertex-edge marking game on graphs
• Coloring games on squares of graphs
• On the relaxed colouring game and the unilateral colouring game

This page was built for publication: Activation strategy for asymmetric marking games

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