{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:15Z","timestamp":1781463315864,"version":"3.54.1"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.017","type":"journal-article","created":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T13:24:32Z","timestamp":1779715472000},"page":"449-455","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On choosability with separation of K5-minor-free graphs"],"prefix":"10.1016","volume":"391","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9882-3926","authenticated-orcid":false,"given":"Yue","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0422-6915","authenticated-orcid":false,"given":"Jian-liang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.05.017_b1","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s00373-017-1812-5","article-title":"(4,2)-Choosability of planar graphs with forbidden structures","volume":"33","author":"Berikkyzy","year":"2017","journal-title":"Graphs Comb."},{"key":"10.1016\/j.dam.2026.05.017_b2","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1007\/s10878-017-0124-2","article-title":"A sufficient condition for planar graphs to be (3,1)-choosable","volume":"34","author":"Chen","year":"2017","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.05.017_b3","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1007\/s40840-016-0409-0","article-title":"On choosability with separation of planar graphs without adjacent short cycles","volume":"41","author":"Chen","year":"2018","journal-title":"Bull. Malays. Math. Sci. Soc"},{"key":"10.1016\/j.dam.2026.05.017_b4","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/jgt.21875","article-title":"On choosability with separation of planar graphs with forbidden cycles","volume":"81","author":"Choi","year":"2016","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.017_b5","series-title":"Graph Theory","author":"Diestel","year":"2016"},{"key":"10.1016\/j.dam.2026.05.017_b6","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1090\/S0002-9904-1943-08065-2","article-title":"A note on primitive skew curves","volume":"49","author":"Hall","year":"1943","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/j.dam.2026.05.017_b7","doi-asserted-by":"crossref","first-page":"1779","DOI":"10.1016\/j.disc.2015.01.008","article-title":"On choosability with separation of planar graphs with lists of different sizes","volume":"338","author":"Kierstead","year":"2015","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.017_b8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<43::AID-JGT7>3.0.CO;2-G","article-title":"Brooks-type theorems for choosability with separation","volume":"27","author":"Kratochv\u00edl","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.017_b9","first-page":"169","article-title":"A note on choosability with separation for planar graphs","volume":"58","author":"\u0160krekovski","year":"2001","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2026.05.017_b10","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.dam.2026.05.017_b11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(93)90579-I","article-title":"List colourings of planar graphs","volume":"120","author":"Voigt","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.017_b12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0012-365X(94)00180-9","article-title":"A not 3-choosable planar graph without 3-cycles","volume":"146","author":"Voigt","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.017_b13","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/BF01594196","article-title":"\u00dcber eine Eigenschaft der ebenen Komplexe","volume":"114","author":"Wagner","year":"1937","journal-title":"Math. Ann."},{"key":"10.1016\/j.dam.2026.05.017_b14","doi-asserted-by":"crossref","first-page":"1782","DOI":"10.1016\/j.disc.2019.02.015","article-title":"On the (3,1)-choosability of planar graphs without adjacent cycles of length 5,6,7","volume":"342","author":"Wang","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.017_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2022.103510","article-title":"The total coloring of K5-minor-free graphs","volume":"102","author":"Yang","year":"2022","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.05.017_b16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.dam.2022.08.006","article-title":"The linear arboricity of K5-minor free graphs","volume":"322","author":"Yang","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.017_b17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2023.04.001","article-title":"List 4-colouring of planar graphs","volume":"162","author":"Zhu","year":"2023","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:08:43Z","timestamp":1781460523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26003021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":17,"alternative-id":["S0166218X26003021"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.017","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On choosability with separation of -minor-free graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.017","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"}]}}