Department of Mathematics
The strong game colouring number of directed graphs
In this paper, we study the strong game colouring number of directed graphs. It is proved that every oriented partial 2-tree has strong game colouring number at most 7 and every oriented planar graph has strong game colouring number at most 15. © 2013 Elsevier B.V. All rights reserved.
Colouring game, Digraph, Marking game, Partial 2-tree, Planar graph
Source Publication Title
Link to Publisher's Edition
Chan, W., Shiu, W., Sun, P., & Zhu, X. (2013). The strong game colouring number of directed graphs. Discrete Mathematics, 313 (10), 1070-1077. https://doi.org/10.1016/j.disc.2013.02.001