森林线图的完全游戏色数(英文)

The complete game coloring number of the line graph of a forest

设F是一个最大度为Δ的森林图.Cai和Zhu已证明了F的线图的游戏色数不超过Δ+2 .本文证明了F的线图的完全游戏色数不超过Δ+2 .

Let F be a forest with maximum degree Δ. Cai and Zhu showed that the game coloring number of the line graph of F is at most Δ+2. This paper shows that the complete game coloring number of the line graph of F is at most Δ+2.