{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:22Z","timestamp":1759335982353,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this paper, a colouring game and two versions of marking games (the weak and the strong) on digraphs are studied. We introduce the weak game chromatic number $\\chi_{\\rm wg}(D)$ and the weak game colouring number ${\\rm wgcol}(D)$ of digraphs $D$. It is proved that if $D$ is an oriented planar graph, then $\\chi_{\\rm wg}(D)$ $\\le {\\rm wgcol}(D) \\le 9$, and if $D$ is an oriented outerplanar graph, then $\\chi_{\\rm wg}(D)$ $\\le {\\rm wgcol}(D) \\le 4$. Then we study the strong game colouring number ${\\rm sgcol}\\left( D \\right)$ (which was first introduced by Andres as game colouring number) of digraphs $D$. It is proved that if $D$ is an oriented planar graph, then  ${\\rm sgcol}\\left( D \\right) \\le 16$. The asymmetric versions of the colouring and marking games of digraphs are also studied. Upper and lower bounds of related parameters for various classes of digraphs are obtained.<\/jats:p>","DOI":"10.37236\/283","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:18:09Z","timestamp":1578698289000},"source":"Crossref","is-referenced-by-count":5,"title":["Game Colouring Directed Graphs"],"prefix":"10.37236","volume":"17","author":[{"given":"Daqing","family":"Yang","sequence":"first","affiliation":[]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2010,1,5]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1r11\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1r11\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T19:02:38Z","timestamp":1579287758000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v17i1r11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,5]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/283","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2010,1,5]]},"article-number":"R11"}}