| Institution: | a Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Prague, Czech Republic
b Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan |
| Abstract: | This paper studies the game chromatic number and game colouring number of the square of graphs. In particular, we prove that if G is a forest of maximum degree Δ≥9, then  , and there are forests G with  . It is also proved that for an outerplanar graph G of maximum degree Δ,  , and for a planar graph G of maximum degree Δ,  . |
