{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T08:43:29Z","timestamp":1776588209338,"version":"3.51.2"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100006407","name":"Henan Province Natural Science Foundation","doi-asserted-by":"publisher","award":["242300420238"],"award-info":[{"award-number":["242300420238"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.amc.2026.130058","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:43:12Z","timestamp":1774438992000},"page":"130058","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Planar graphs that exclude {4, 5, 7, 8}-cycles and intersecting triangles are DP-3-colorable"],"prefix":"10.1016","volume":"525","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6756-2421","authenticated-orcid":false,"given":"Dazhi","family":"Lin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9732-1617","authenticated-orcid":false,"given":"Tao","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0222-1106","authenticated-orcid":false,"given":"Ya-Nan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2026.130058_bib0001","series-title":"Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979)","first-page":"125","article-title":"Choosability in graphs","author":"Erd\u0151s","year":"1980"},{"key":"10.1016\/j.amc.2026.130058_bib0002","first-page":"3","article-title":"Coloring the vertices of a graph in prescribed colors","volume":"29","author":"Vizing","year":"1976","journal-title":"Diskret. Analiz."},{"key":"10.1016\/j.amc.2026.130058_bib0003","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jctb.2017.09.001","article-title":"Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8","volume":"129","author":"Dvo\u0159\u00e1k","year":"2018","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"10.1016\/j.amc.2026.130058_bib0004","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.disc.2012.11.011","article-title":"Colorings of plane graphs: a survey","volume":"313","author":"Borodin","year":"2013","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.amc.2026.130058_bib0005","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. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.amc.2026.130058_bib0006","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.disc.2018.09.025","article-title":"DP-3-coloring of some planar graphs","volume":"342","author":"Liu","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130058_bib0007","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.dam.2021.02.034","article-title":"DP-3-coloring of planar graphs without certain cycles","volume":"297","author":"Rao","year":"2021","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"10.1016\/j.amc.2026.130058_bib0008","doi-asserted-by":"crossref","first-page":"2333","DOI":"10.1016\/j.disc.2019.05.014","article-title":"Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable","volume":"342","author":"Yin","year":"2019","journal-title":"Discrete Math."},{"issue":"3\u20134","key":"10.1016\/j.amc.2026.130058_bib0009","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.ipl.2008.01.008","article-title":"On 3-choosability of planar graphs without certain cycles","volume":"107","author":"Zhang","year":"2008","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"10.1016\/j.amc.2026.130058_bib0010","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.disc.2006.02.001","article-title":"Bordeaux 3-color conjecture and 3-choosability","volume":"306","author":"Montassier","year":"2006","journal-title":"Discrete Math."},{"issue":"11","key":"10.1016\/j.amc.2026.130058_bib0011","doi-asserted-by":"crossref","first-page":"1920","DOI":"10.3390\/math8111920","article-title":"Every planar graph with the distance of 5\u2212-cycles at least 3 from each other is DP-3-colorable","volume":"8","author":"Zhao","year":"2020","journal-title":"Mathematics"},{"issue":"1","key":"10.1016\/j.amc.2026.130058_bib0012","doi-asserted-by":"crossref","DOI":"10.3390\/math9010070","article-title":"Planar graphs with the distance of 6\u2212-cycles at least 2 from each other are DP-3-colorable","volume":"9","author":"Zhao","year":"2020","journal-title":"Mathematics"},{"issue":"2","key":"10.1016\/j.amc.2026.130058_bib0013","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1002\/jgt.23123","article-title":"Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable","volume":"107","author":"Kang","year":"2024","journal-title":"J. Graph Theory"},{"issue":"20","key":"10.1016\/j.amc.2026.130058_bib0014","doi-asserted-by":"crossref","first-page":"2584","DOI":"10.1016\/j.disc.2010.03.021","article-title":"Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable","volume":"310","author":"Borodin","year":"2010","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.amc.2026.130058_bib0015","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.jctb.2004.11.001","article-title":"Planar graphs without cycles of length from 4 to 7 are 3-colorable","volume":"93","author":"Borodin","year":"2005","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.amc.2026.130058_bib0016","doi-asserted-by":"crossref","unstructured":"J.-B. Lv, Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable, Graphs Combin, 38(2022)article number 8.","DOI":"10.1007\/s00373-021-02407-5"},{"issue":"11","key":"10.1016\/j.amc.2026.130058_bib0017","doi-asserted-by":"crossref","first-page":"2984","DOI":"10.1016\/j.disc.2019.05.032","article-title":"DP-4-colorability of two classes of planar graphs","volume":"342","author":"Chen","year":"2019","journal-title":"Discrete Math."},{"issue":"9","key":"10.1016\/j.amc.2026.130058_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114076","article-title":"Toroidal graphs without K5\u2212 and 6-cycles","volume":"347","author":"Chen","year":"2024","journal-title":"Discrete Math."},{"issue":"11","key":"10.1016\/j.amc.2026.130058_bib0019","doi-asserted-by":"crossref","first-page":"2735","DOI":"10.1007\/s10114-024-2245-8","article-title":"Variable degeneracy of planar graphs without chorded 6-cycles","volume":"40","author":"Fang","year":"2024","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"issue":"6","key":"10.1016\/j.amc.2026.130058_bib0020","first-page":"861","article-title":"Planar graphs without chordal 6-cycles and necklaces are DP-4-colorable","volume":"50","author":"Huang","year":"2021","journal-title":"Adv. Math. (China)"},{"issue":"8","key":"10.1016\/j.amc.2026.130058_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2019.111714","article-title":"Planar graphs without 7-cycles and butterflies are DP-4-colorable","volume":"343","author":"Kim","year":"2020","journal-title":"Discrete Math."},{"issue":"7","key":"10.1016\/j.amc.2026.130058_bib0022","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1016\/j.disc.2018.03.027","article-title":"A sufficient condition for DP-4-colorability","volume":"341","author":"Kim","year":"2018","journal-title":"Discrete Math."},{"issue":"11","key":"10.1016\/j.amc.2026.130058_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112568","article-title":"DP-4-coloring of planar graphs with some restrictions on cycles","volume":"344","author":"Li","year":"2021","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.amc.2026.130058_bib0024","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.disc.2018.10.025","article-title":"Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable","volume":"342","author":"Liu","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130058_bib0025","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.dam.2019.09.012","article-title":"DP-4-colorability of planar graphs without adjacent cycles of given length","volume":"277","author":"Liu","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130058_bib0026","series-title":"Variable degeneracy of graphs with restricted structures","author":"Wang","year":"2026"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326001104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326001104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T08:12:28Z","timestamp":1776586348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300326001104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":26,"alternative-id":["S0096300326001104"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2026.130058","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Planar graphs that exclude {4, 5, 7, 8}-cycles and intersecting triangles are DP-3-colorable","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2026.130058","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"130058"}}