{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T06:20:45Z","timestamp":1775802045037,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:00:00Z","timestamp":1775779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:00:00Z","timestamp":1775779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100019492","name":"National Natural Science Foundation of China-China Academy of General Technology Joint Fund for Basic Research","doi-asserted-by":"publisher","award":["12371359"],"award-info":[{"award-number":["12371359"]}],"id":[{"id":"10.13039\/501100019492","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00373-026-03042-8","type":"journal-article","created":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T05:34:20Z","timestamp":1775799260000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Indicated multifold-choosability of graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Jiacheng","family":"Zhu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5502-5390","authenticated-orcid":false,"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Zhanghao","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"3042_CR1","doi-asserted-by":"crossref","unstructured":"Kojima, S., Kawabe, K.O.H., Kobayashi, Y.: Brooks\u2019 type theorem for indicated coloring game, manuscript (2024)","DOI":"10.1007\/s00373-025-02975-w"},{"key":"3042_CR2","unstructured":"Gu, Y., Jiang, Y., Zhou, H., Zhu, J., Zhu, X.: Indicated list colouring game on graphs. arXiv:2502.16073 (2025)"},{"issue":"23","key":"3042_CR3","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(23), 3467\u20133472 (2012)","journal-title":"Discrete Math."},{"key":"3042_CR4","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), volume XXVI of Congress. Numer., pp. 125\u2013157. Utilitas Math., Winnipeg, MB (1980)"},{"key":"3042_CR5","doi-asserted-by":"crossref","unstructured":"Alon, N., Tuza, Z., Voigt, M.: Choosability and fractional chromatic numbers. volume 165\/166, pp. 31\u201338. 1997. Graphs and combinatorics Marseille (1995)","DOI":"10.1016\/S0012-365X(96)00159-8"},{"key":"3042_CR6","first-page":"9","volume":"5","author":"Z Dvo\u0159\u00e1k","year":"2019","unstructured":"Dvo\u0159\u00e1k, Z., Hu, X., Sereni, J.: A 4-choosable graph that is not $$(8:2)$$-choosable. Adv. Comb. 5, 9 (2019)","journal-title":"Adv. Comb."},{"issue":"3","key":"3042_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-M","volume":"22","author":"Z Tuza","year":"1996","unstructured":"Tuza, Z., Voigt, M.: Every $$2$$-choosable graph is $$(2m, m)$$-choosable. J. Graph Theory 22(3), 245\u2013252 (1996)","journal-title":"J. Graph Theory"},{"issue":"15","key":"3042_CR8","doi-asserted-by":"publisher","first-page":"4931","DOI":"10.1016\/j.disc.2008.05.021","volume":"309","author":"M Stiebitz","year":"2009","unstructured":"Stiebitz, M., Tuza, Z., Voigt, M.: On list critical graphs. Discrete Math. 309(15), 4931\u20134941 (2009)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03042-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03042-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03042-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T05:34:22Z","timestamp":1775799262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03042-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,10]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3042"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03042-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,10]]},"assertion":[{"value":"9 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2026","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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"45"}}