{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T18:45:24Z","timestamp":1774464324027,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.disc.2026.115035","type":"journal-article","created":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T14:46:19Z","timestamp":1770734779000},"page":"115035","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degree-truncated choice number of planar graphs"],"prefix":"10.1016","volume":"349","author":[{"given":"Yiting","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huijuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinbo","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5502-5390","authenticated-orcid":false,"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.disc.2026.115035_br0010","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1002\/jgt.20628","article-title":"List colorings of K5-minor-free graphs with special list assignments","volume":"71","author":"Cranston","year":"2012","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115035_br0020","series-title":"Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing","first-page":"125","article-title":"Choosability in graphs","volume":"vol. XXVI","author":"Erd\u0151s","year":"1980"},{"issue":"1","key":"10.1016\/j.disc.2026.115035_br0030","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/jgt.20326","article-title":"On list-coloring outerplanar graphs","volume":"59","author":"Hutchinson","year":"2008","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115035_br0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2025.104306","article-title":"Degree-truncated DP-colourability of K2,4-minor-free graphs","volume":"133","author":"Lo","year":"2026","journal-title":"Eur. J. Comb."},{"issue":"4","key":"10.1016\/j.disc.2026.115035_br0060","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","article-title":"Rectilinear planar layouts and bipolar orientations of planar graphs","volume":"1","author":"Rosenstiehl","year":"1986","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10.1016\/j.disc.2026.115035_br0070","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jctb.1994.1062","article-title":"Every planar graph is 5-choosable","volume":"62","author":"Thomassen","year":"1994","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115035_br0080","first-page":"3","article-title":"Coloring the vertices of a graph in prescribed colors","volume":"29","author":"Vizing","year":"1976","journal-title":"Diskretn. Anal."},{"key":"10.1016\/j.disc.2026.115035_br0090","unstructured":"H. Xu, H. Zhou, J. Zhu, X. Zhu, Tighter bounds on the degree-truncated choice number of planar graphs, Manuscript."},{"key":"10.1016\/j.disc.2026.115035_br0100","author":"Zhou"},{"key":"10.1016\/j.disc.2026.115035_br0110","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.jctb.2025.07.003","article-title":"Degree-truncated choosability of graphs","volume":"175","author":"Zhou","year":"2025","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26000592?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26000592?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T17:21:30Z","timestamp":1774459290000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26000592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":10,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0012365X26000592"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115035","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Degree-truncated choice number of planar graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115035","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115035"}}