Lower bounds for the game colouring number of partial k-trees and planar graphs

This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the maximum game colouring number of planar graphs, respectively. In this paper, we prove that

• Type: Journal
• Year: 2008
• Where: DM
• Authors: Jiaojiao Wu, Xuding Zhu
• Keywords: DM 2008, Game, Maximum Game, Partial K-trees