{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:53Z","timestamp":1740107153023,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00373-019-02125-z","type":"journal-article","created":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T17:02:51Z","timestamp":1576602171000},"page":"153-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Coloring a Token Graph"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9680-8949","authenticated-orcid":false,"given":"Kevin G.","family":"Milans","sequence":"first","affiliation":[]},{"given":"Michael C.","family":"Wigal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,17]]},"reference":[{"key":"2125_CR1","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201996, pp. 531\u2013540. ACM, New York (1996)","DOI":"10.1145\/237814.238001"},{"issue":"2","key":"2125_CR2","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1137\/S009753979833965X","volume":"36","author":"Y Bartal","year":"2006","unstructured":"Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. SIAM J. Comput. 36(2), 354\u2013393 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2125_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s11083-011-9197-1","volume":"29","author":"B Bosek","year":"2012","unstructured":"Bosek, B., Felsner, S., Kloch, K., Krawczyk, T., Matecki, G., Micek, P.: On-line chain partitions of orders: a survey. Order 29(1), 49\u201373 (2012)","journal-title":"Order"},{"issue":"3","key":"2125_CR4","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/s00224-007-9085-7","volume":"45","author":"TM Chan","year":"2009","unstructured":"Chan, T.M., Zarrabi-Zadeh, H.: A randomized algorithm for online unit clustering. Theory Comput. Syst. 45(3), 486\u2013496 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"2125_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. (2) 164(1), 51\u2013229 (2006)","journal-title":"Ann. Math. (2)"},{"issue":"3","key":"2125_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Appl. Math. 3(3), 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"issue":"Supplement C","key":"2125_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.07.008","volume":"500","author":"MR Ehmsen","year":"2013","unstructured":"Ehmsen, M.R., Larsen, K.S.: Better bounds on online unit clustering. Theor. Comput. Sci. 500(Supplement C), 1\u201324 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"2125_CR8","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/11523468_49","volume-title":"Automata, Languages and Programming","author":"L Epstein","year":"2005","unstructured":"Epstein, L., Levy, M.: Online interval coloring and variants. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) Automata, Languages and Programming, pp. 602\u2013613. Springer, Berlin (2005)"},{"issue":"1","key":"2125_CR9","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/1868237.1868245","volume":"7","author":"L Epstein","year":"2010","unstructured":"Epstein, L., Van Stee, R.: On the online unit clustering problem. ACM Trans. Algorithms 7(1), 7:1\u20137:18 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"2125_CR10","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M.: Online coloring known graphs. Electron. J. Combin. 7, Research Paper 7, 9 (2000)","DOI":"10.37236\/1485"},{"issue":"1","key":"2125_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(94)90157-0","volume":"130","author":"MM Halld\u00f3rsson","year":"1994","unstructured":"Halld\u00f3rsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theor. Comput. Sci. 130(1), 163\u2013174 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"19\u201320","key":"2125_CR12","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1016\/j.disc.2006.05.021","volume":"306","author":"S Hougardy","year":"2006","unstructured":"Hougardy, S.: Classes of perfect graphs. Discrete Math. 306(19\u201320), 2529\u20132571 (2006)","journal-title":"Discrete Math."},{"issue":"2","key":"2125_CR13","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1137\/16M1097821","volume":"32","author":"K Junosza-Szaniawski","year":"2018","unstructured":"Junosza-Szaniawski, K., Rz\u0105\u017cewski, P., Sok\u00f3\u0142, J., W\u0119sek, K.: Online coloring and $$L(2,1)$$-labeling of unit disk intersection graphs. SIAM J. Discrete Math. 32(2), 1335\u20131350 (2018)","journal-title":"SIAM J. Discrete Math."},{"issue":"Supplement C","key":"2125_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2015.06.055","volume":"600","author":"J Kawahara","year":"2015","unstructured":"Kawahara, J., Kobayashi, K.M.: An improved lower bound for one-dimensional online unit clustering. Theor. Comput. Sci. 600(Supplement C), 171\u2013173 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2125_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02780324","volume":"105","author":"HA Kierstead","year":"1998","unstructured":"Kierstead, H.A.: On-line coloring $$k$$-colorable graphs. Isr. J. Math. 105(1), 93\u2013104 (1998)","journal-title":"Isr. J. Math."},{"key":"2125_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BFb0029574","volume-title":"Online Algorithms: The State of the Art","author":"HA Kierstead","year":"1998","unstructured":"Kierstead, H.A.: Coloring graphs on-line. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 281\u2013305. Springer, Berlin (1998)"},{"issue":"1\u20133","key":"2125_CR17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","volume":"75","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L., Saks, M., Trotter, W.T.: An on-line graph coloring algorithm with sublinear performance ratio. Discrete Math. 75(1\u20133), 319\u2013325 (1989)","journal-title":"Discrete Math."},{"issue":"2","key":"2125_CR18","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G","volume":"36","author":"C McDiarmid","year":"2000","unstructured":"McDiarmid, C., Reed, B.: Channel assignment and weighted coloring. Networks 36(2), 114\u2013117 (2000)","journal-title":"Networks"},{"issue":"2","key":"2125_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0095-8956(76)90010-1","volume":"20","author":"S Stahl","year":"1976","unstructured":"Stahl, S.: n-tuple colorings and associated graphs. J. Combin. Theory Ser. B 20(2), 185\u2013203 (1976)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02125-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02125-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02125-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,16]],"date-time":"2020-12-16T01:12:39Z","timestamp":1608081159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02125-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,17]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["2125"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02125-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,12,17]]},"assertion":[{"value":"21 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}