{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:42:22Z","timestamp":1775839342383,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T00:00:00Z","timestamp":1759449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T00:00:00Z","timestamp":1759449600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"JSPS KAKENHI","award":["19H01803"],"award-info":[{"award-number":["19H01803"]}]},{"name":"JSPS KAKENHI","award":["20H5795"],"award-info":[{"award-number":["20H5795"]}]},{"name":"JSPS KAKENHI","award":["22K19773"],"award-info":[{"award-number":["22K19773"]}]},{"name":"JSPS KAKENHI","award":["23K03195"],"award-info":[{"award-number":["23K03195"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00373-025-02975-w","type":"journal-article","created":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T17:53:43Z","timestamp":1759514023000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Brooks\u2019 Type Theorem for Indicated Coloring Game"],"prefix":"10.1007","volume":"41","author":[{"given":"Haruki","family":"Kawabe","sequence":"first","affiliation":[]},{"given":"Yosuke","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Shieri","family":"Kojima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3118-0086","authenticated-orcid":false,"given":"Kenta","family":"Ozeki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,3]]},"reference":[{"key":"2975_CR1","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1016\/j.jctb.2007.12.006","volume":"98","author":"L Addario-Berry","year":"2008","unstructured":"Addario-Berry, L., Chudnovsky, M., Havet, F., Reed, B., Seymour, P.: Bisimplicial vertices in even-holefree graphs. J. Combin Theory, Ser. B 98, 1119\u20131164 (2008)","journal-title":"J. Combin Theory, Ser. B"},{"key":"2975_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.dam.2020.11.007","volume":"289","author":"B Bre\u0161ar","year":"2021","unstructured":"Bre\u0161ar, B., Jakovac, M., \u0160tesl, D.: Indicated coloring game on cartesian products of graphs. Discrete Appli. Math. 289, 320\u2013326 (2021)","journal-title":"Discrete Appli. Math."},{"key":"2975_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.jctb.2023.02.009","volume":"161","author":"M Chudnovsky","year":"2023","unstructured":"Chudnovsky, M., Seymour, P.: Even-hole-free graphs still have bisimplicial vertices. J. Combin Theory, Ser. B 161, 331\u2013381 (2023)","journal-title":"J. Combin Theory, Ser. B"},{"key":"2975_CR4","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/j.dam.2021.04.021","volume":"319","author":"P Francis","year":"2022","unstructured":"Francis, P., Raj, S.F., Gokulnath, M.: On indicated coloring of lexicographic product of graphs. Discrete Appli. Math. 319, 576\u2013582 (2022)","journal-title":"Discrete Appli. Math."},{"key":"2975_CR5","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1007\/s00373-019-02061-y","volume":"35","author":"P Francis","year":"2019","unstructured":"Francis, P., Raj, S.F., Gokulnath, M.: On indicated coloring of some classes of graphs. Graphs Combin. 35, 1105\u20131127 (2019)","journal-title":"Graphs Combin."},{"key":"2975_CR6","doi-asserted-by":"publisher","first-page":"3467","DOI":"10.1016\/j.disc.2012.07.001","volume":"312","author":"A Grzesik","year":"2012","unstructured":"Grzesik, A.: Indicated coloring of graphs. Discrete Math. 312, 3467\u20133472 (2012)","journal-title":"Discrete Math."},{"key":"2975_CR7","unstructured":"Gu, Y., Jiang, Y., Zhou, H., Zhu, J., Zhu, X.: Indicated list colouring game on graphs, arXiv: 2502.16073"},{"key":"2975_CR8","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1007\/s00373-014-1508-z","volume":"31","author":"RP Raj","year":"2015","unstructured":"Raj, R.P., Raj, S.F., Patil, H.P.: On indicated coloring of graphs. Graphs Combin. 31, 2357\u20132367 (2015)","journal-title":"Graphs Combin."},{"key":"2975_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00373-016-1747-2","volume":"33","author":"RP Raj","year":"2017","unstructured":"Raj, R.P., Raj, S.F., Patil, H.P.: On indicated chromatic number of graphs. Graphs Combin. 33, 203\u2013219 (2017)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02975-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02975-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02975-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:35Z","timestamp":1765164035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02975-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,3]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2975"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02975-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,3]]},"assertion":[{"value":"12 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. The fourth author is a Principal Editor of Graphs and Combinatorics.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"113"}}