{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:27:58Z","timestamp":1740144478629,"version":"3.37.3"},"reference-count":13,"publisher":"EDP Sciences","issue":"5","license":[{"start":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:00:00Z","timestamp":1699833600000},"content-version":"vor","delay-in-days":73,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2023,10,3]]},"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:p>In this paper, we study <jats:italic>bichromatic coloring game<\/jats:italic> on a disk triangulation, which is introduced by Aichholzer et al. in 2005. They proved that if a disk triangulation has at most two inner vertices, then the second player can force a tie in the bichromatic coloring game on the disk triangulation. We prove that the same statement holds for any disk triangulation with at most four inner vertices, and that the bound of the number of inner vertices is the best possible. Furthermore, we consider the game on topological triangulations.<\/jats:p>","DOI":"10.1051\/ro\/2023162","type":"journal-article","created":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T08:00:41Z","timestamp":1696406441000},"page":"2929-2939","source":"Crossref","is-referenced-by-count":0,"title":["Bichromatic coloring game on triangulations"],"prefix":"10.1051","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2861-7152","authenticated-orcid":false,"given":"Naoki","family":"Matsumoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2023,11,13]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.tcs.2005.05.007","volume":"343","author":"Aichholzer","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"R2","first-page":"113","volume":"1","author":"Allen","year":"2014","journal-title":"Eur. Math. Soc."},{"key":"R3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(94)00081-S","volume":"151","author":"Berge","year":"1996","journal-title":"Discrete Math."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Berlekamp E.R., Conway J.H. and Guy R.K., Winning Ways for Your Mathematical Plays. A K Peters\/CRC Press, Vol. 4 (1982\u20132004).","DOI":"10.1201\/9780429487309"},{"key":"R5","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1137\/100786800","volume":"24","author":"Bre\u0161ar","year":"2010","journal-title":"SIAM J. Discrete Math."},{"key":"R6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0097-3165(73)90005-8","volume":"14","author":"Erd\u00f6s","year":"1973","journal-title":"J. Comb. Theory Ser. A"},{"key":"R7","first-page":"143","volume":"35","author":"Faigle","year":"1993","journal-title":"Ars Comb."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Fraenkel A.S., Combinatorial games: Selected bibliography with a succinct gourmet introduction. Electron. J. Comb. (2012) #DS2.","DOI":"10.37236\/22"},{"key":"R9","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(93)90026-P","volume":"112","author":"Fraenkel","year":"1993","journal-title":"Theor. Comput. Sci."},{"key":"R10","first-page":"#2","volume":"19","author":"Gravier","year":"2017","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"R11","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1090\/S0002-9947-1963-0143712-1","volume":"106","author":"Hales","year":"1963","journal-title":"Trans. Am. Math. Soc."},{"key":"R12","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1145\/322186.322201","volume":"27","author":"Lichtenstein","year":"1980","journal-title":"J. ACM"},{"key":"R13","doi-asserted-by":"crossref","first-page":"#R77","DOI":"10.37236\/166","volume":"16","author":"Schauz","year":"2009","journal-title":"Correct. Electron. J. Comb."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023162\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T09:08:44Z","timestamp":1699866524000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":13,"journal-issue":{"issue":"5"},"alternative-id":["ro220736"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2023162","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2023,9]]}}}