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

Daqing Yang · Fuzhou daxue xuebao. Ziran kexue ban · 2005

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.

Read the paper · More papers on PaperTik