|
|||||
|
|
Lower bounds for the game colouring number of partial k-trees and planar graphs |
|
| Authors: | Jiaojiao Wu |
| Affiliation: | a Institute of Mathematics, Academia Sinica, Taipei 115, Taiwan b Department of Applied Mathematics, National Sun Yat-sen University, Taiwan c National Center for Theoretical Sciences, Taiwan |
| Abstract: | This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PTk) 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 colg(PTk)=3k+2 and colg(P)?11. We also prove that the game colouring number colg(G) of a graph is a monotone parameter, i.e., if H is a subgraph of G, then colg(H)?colg(G). |
| Keywords: | 05C20 05C35 05C15 |
| 本文献已被 ScienceDirect 等数据库收录！ | |