{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T14:47:31Z","timestamp":1764946051922,"version":"3.46.0"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"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 Applied Mathematics"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.dam.2025.10.016","type":"journal-article","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T08:17:42Z","timestamp":1760602662000},"page":"228-246","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Flexibility of planar graphs without\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e1257\" altimg=\"si7.svg\">\n                      <mml:msub>\n                        <mml:mrow>\n                          <mml:mi>C<\/mml:mi>\n                        <\/mml:mrow>\n                        <mml:mrow>\n                          <mml:mn>4<\/mml:mn>\n                        <\/mml:mrow>\n                      <\/mml:msub>\n                    <\/mml:math>\n                    and\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e1267\" altimg=\"si8.svg\">\n                      <mml:msub>\n                        <mml:mrow>\n                          <mml:mi>C<\/mml:mi>\n                        <\/mml:mrow>\n                        <mml:mrow>\n                          <mml:mn>5<\/mml:mn>\n                        <\/mml:mrow>\n                      <\/mml:msub>\n                    <\/mml:math>"],"prefix":"10.1016","volume":"380","author":[{"given":"Donglei","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1511-6586","authenticated-orcid":false,"given":"Fan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2025.10.016_b1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","article-title":"Combinatorial Nullstellensatz","volume":"8","author":"Alon","year":"1999","journal-title":"Combin. Probab. Comput."},{"year":"1976","series-title":"Graph theory with application","author":"Bondy","key":"10.1016\/j.dam.2025.10.016_b2"},{"key":"10.1016\/j.dam.2025.10.016_b3","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.dam.2021.09.021","article-title":"Flexibility of planar graphs-sharpening the tools to get lists of size four","volume":"306","author":"Choi","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.10.016_b4","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.jctb.2016.07.006","article-title":"Steinberg\u2019s conjecture is false","volume":"122","author":"Cohen-Addad","year":"2017","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.016_b5","doi-asserted-by":"crossref","DOI":"10.1002\/jgt.22567","article-title":"Flexibility of planar graphs of girth at least six","author":"Dvo\u0159\u00e1k","year":"2020","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2025.10.016_b6","doi-asserted-by":"crossref","DOI":"10.1002\/jgt.22567","article-title":"Flexibility of triangle-free planar graphs","author":"Dvo\u0159\u00e1k","year":"2020","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2025.10.016_b7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/jgt.22447","article-title":"List coloring with requests","volume":"92","author":"Dvo\u0159\u00e1k","year":"2019","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2025.10.016_b8","first-page":"125","article-title":"Choosability in graphs","volume":"26","author":"Erd\u0151s","year":"1980","journal-title":"Congr, Number."},{"key":"10.1016\/j.dam.2025.10.016_b9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jctb.1998.1893","article-title":"The 4-choosability of plane graphs without 4-cycles","volume":"76","author":"Lam","year":"1999","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.016_b10","first-page":"935","article-title":"Flexibility of planar graphs without 4-cycles","volume":"88","author":"Masa\u0159\u00edk","year":"2019","journal-title":"Acta Math. Univ. Comen."},{"key":"10.1016\/j.dam.2025.10.016_b11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/jctb.1995.1027","article-title":"3-list-coloring planar graphs of girth 5","volume":"64","author":"Thomassen","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.016_b12","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1016\/j.disc.2005.11.041","article-title":"A non-3-choosable planar graph without cycles of length 4 and 5","volume":"307","author":"Voigt","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.10.016_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.113298","article-title":"4-Choosability of planar graphs with 4-cycles far apart via the combinatorial Nullstellensatz","volume":"346","author":"Yang","year":"2023","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25005785?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25005785?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T14:44:07Z","timestamp":1764945847000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X25005785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":13,"alternative-id":["S0166218X25005785"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2025.10.016","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Flexibility of planar graphs without  and","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2025.10.016","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}