一个新的激活策略在偏k-树上的应用

A new activation strategy of relaxed coloring game on partial k-tree

笔者使用一个新的激活策略证明了 ,如果G是一个偏k -树 ,其色数为r=k + 1 ,缺陷度d≥ 2k + 1 ,那么 ,对这个 (r,d) -松弛竞赛染色 ,Alice有一个赢的策略。这个结果可以写为 ( 2k+ 1 ) - χg(G)≤k+ 1 ,它是文献

In this paper,we use a new activation strategy to prove that if G is a partial k tree,the chromatic number r=k+1 and the defect d≥2k+1 ,then Alice has a winning strategy for the (r,d) relaxed coloring game.The result can be written as (2k+1)- χ g(G)≤k+1 ,it is a improvement of responding result in literature [3] .