@article{04bff80ffb3740d7bd01a8787e4d774a,
title = "The strong game colouring number of directed graphs",
abstract = "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.",
keywords = "Colouring game, Digraph, Marking game, Partial 2-tree, Planar graph",
author = "Chan, \{Wai Hong\} and Shiu, \{Wai Chee\} and Sun, \{Pak Kiu\} and Xuding Zhu",
note = "Funding Information: The first author was partially supported by Internal Research Grant R3297 , HKIEd . The fourth author was supported by Natural Science Foundation of China under Grant NSF11171310 and Natural Science foundation of Zhejiang Province under Grant Z6110786 . ",
year = "2013",
month = may,
day = "28",
doi = "10.1016/j.disc.2013.02.001",
language = "English",
volume = "313",
pages = "1070--1077",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier B.V.",
number = "10",
}