Activation strategy for asymmetric marking games

DOI10.1016/J.EJC.2007.07.004zbMATH Open1143.91008OpenAlexW2110779223MaRDI QIDQ925014FDOQ925014

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

chordal graphactivation strategymarking games

Mathematics Subject Classification ID

Games involving graphs (91A43)

Cites Work

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

Cited In (9)

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

   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 👍 👎

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)