Activation strategy for asymmetric marking games

https://doi.org/10.1016/j.ejc.2007.07.004Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper extends the widely used activation strategy of the marking game on graphs to asymmetric marking games. The extended activation strategy is then applied to asymmetric marking games on chordal graphs, (s,t)-pseudo partial k-trees and interval graphs. Our results improve earlier upper bounds on (a,1)-gcol(Ik) and (a,1)-gcol(Ck), where Ik and Ck denote the classes of interval and chordal graphs with maximum clique size k+1 respectively. Moreover, the upper bound of (a,1)-gcol(Ik) is tight when k is a multiple of a.

Cited by (0)

1

Tel.: +86 591 83058251; fax: +86 591 83846622.