恰含有一个偶圈的单圈图的着色游戏

Coloring game on the unicyclic graph with just an even cycle

令f是一个把任意图H映射到非负整数且满足f(H)≤V(H)的图函数.定义图函数f为f(K2)=2,f(P8)=3,f(C2n)=3,其余未定义的子图满足f(H)=0.证明了恰含有一个偶圈的单圈图的f-无圈游戏色数不超过9.

Let f be a graph function which assigns to each graph H a non-negative integer f（H）≤V（H）.f is defined as f（K2）=2,f（P8）=3,f（C2n）=3 and f（H）=0 otherwise.It is proved that the f-acyclic game chromatic number of an unicyclic graph with just an even cycle is 9 at most.