{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:46:29Z","timestamp":1763642789139,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Ne\u0161et\u0159il and Sopena introduced a concept of oriented game chromatic number and developed a general technique for bounding this parameter.  In this paper, we combine their technique with concepts introduced by several authors in a series of papers on game chromatic number to show that for every positive integer $k$, there exists an integer $t$ so that if ${\\cal C}$ is a topologically closed class of graphs and ${\\cal C}$ does not contain a complete graph on $k$ vertices, then whenever $G$ is an orientation of a graph from ${\\cal C}$, the oriented game chromatic number of $G$ is at most $t$. In particular, oriented planar graphs have bounded oriented game chromatic number.  This answers a question raised by Ne\u0161et\u0159il and Sopena.  We also answer a second question raised by Ne\u0161et\u0159il and Sopena by constructing a family of oriented graphs for which oriented game chromatic number is bounded but extended Go number is not.<\/jats:p>","DOI":"10.37236\/1611","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:15:14Z","timestamp":1578708914000},"source":"Crossref","is-referenced-by-count":11,"title":["Competitive Colorings of Oriented Graphs"],"prefix":"10.37236","volume":"8","author":[{"given":"H. A.","family":"Kierstead","sequence":"first","affiliation":[]},{"given":"W. T.","family":"Trotter","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2000,9,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i2r12\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i2r12\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:21:56Z","timestamp":1579324916000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v8i2r12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9,7]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2001,2,6]]}},"URL":"https:\/\/doi.org\/10.37236\/1611","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2000,9,7]]},"article-number":"R12"}}