{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:17:26Z","timestamp":1768713446153,"version":"3.49.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319181721","type":"print"},{"value":"9783319181738","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_23","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"313-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete"],"prefix":"10.1007","author":[{"given":"Christian","family":"Kudahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1142\/S0129054191000091","volume":"2","author":"HL Bodlaender","year":"1989","unstructured":"Bodlaender, H.L.: On the complexity of some coloring games. Internat. J. Found. Comput. Sci. 2, 133\u2013147 (1989)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"23_CR2","first-page":"168","volume":"29C","author":"A Gyarfas","year":"1990","unstructured":"Gyarfas, A., Lehel, J.: First fit and on-line chromatic number of families of graphs. Ars Combinatorica 29C, 168\u2013176 (1990)","journal-title":"Ars Combinatorica"},{"key":"23_CR3","unstructured":"Gyarfas, A., Kiraly, Z., Lehel, J.: On-line competitive coloring algorithms. Tech. rep., Mathematical Institute of Eotvos Lorand University (1997). http:\/\/www.cs.elte.hu\/tr97"},{"issue":"2","key":"23_CR4","first-page":"139","volume":"62","author":"J Kratochv","year":"1993","unstructured":"Kratochv, J.: Precoloring extension with fixed color bound. Acta Mathematica Universitatis Comenianae 62(2), 139\u2013153 (1993). http:\/\/eudml.org\/doc\/118661","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-662-43948-7_61","volume-title":"Automata, Languages, and Programming","author":"T Krawczyk","year":"2014","unstructured":"Krawczyk, T., Walczak, B.: Coloring relatives of interval overlap graphs via on-line games. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 738\u2013750. Springer, Heidelberg (2014)"},{"key":"23_CR6","unstructured":"Kudahl, C.: On-line Graph Coloring. Master\u2019s thesis, University of Southern Denmark (2013)"},{"key":"23_CR7","unstructured":"Kudahl, C.: Deciding the on-line chromatic number of a graph with pre-coloring is pspace-complete. CoRR abs\/1406.1623 (2014). http:\/\/arxiv.org\/abs\/1406.1623"},{"key":"23_CR8","unstructured":"Lehel, A.G.J., Kiraly, Z.: On-line graph coloring and finite basis problems. Combinatorics: Paul Erdos is Eighty, vol. 1, 207\u2013214 (1993)"},{"issue":"6","key":"23_CR9","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.dam.2005.10.008","volume":"154","author":"D Marx","year":"2006","unstructured":"Marx, D.: Precoloring extension on unit interval graphs. Discrete Applied Mathematics 154(6), 995\u20131002 (2006). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X05003392","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"LJ Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theoretical Computer Science 3(1), 1\u201322 (1976)","journal-title":"Theoretical Computer Science"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.7151\/dmgt.1049","volume":"17","author":"Z Tuza","year":"1997","unstructured":"Tuza, Z.: Graph colorings with local constraints - a survey. Math. Graph Theory 17, 161\u2013228 (1997)","journal-title":"Math. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T08:56:03Z","timestamp":1676451363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}