It is proved that if G is an outplanar graph,then for d=2,3,4,and k=7-d,Alice has a winning strategy for the (k,d)-relaxed coloring game for G.

• 如果缺陷度d =2 ,3 ,4 ,k =7-d ,我们能够分别给Alice一个策略 ,使得对 (k ,d) 松弛染色竞赛Alice能赢。