{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:05Z","timestamp":1781463305146,"version":"3.54.1"},"reference-count":19,"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\/501100006407","name":"Henan Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]}],"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.018","type":"journal-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T14:27:29Z","timestamp":1779805649000},"page":"488-495","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Weak-strict degeneracy on line graphs of planar graphs"],"prefix":"10.1016","volume":"391","author":[{"given":"Zhengjiao","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9732-1617","authenticated-orcid":false,"given":"Tao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaojing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.dam.2026.05.018_b1","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1002\/jgt.22938","article-title":"Weak degeneracy of graphs","volume":"103","author":"Bernshteyn","year":"2023","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.dam.2026.05.018_b2","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1137\/130927449","article-title":"Planar graphs with \u0394\u22658 are (\u0394+1)-edge-choosable","volume":"29","author":"Bonamy","year":"2015","journal-title":"SIAM J. Discrete Math."},{"issue":"21","key":"10.1016\/j.dam.2026.05.018_b3","doi-asserted-by":"crossref","first-page":"3049","DOI":"10.1016\/j.disc.2010.07.004","article-title":"Planar graphs with maximum degree \u0394\u22659 are (\u0394+1)-edge-choosable\u2014a short proof","volume":"310","author":"Cohen","year":"2010","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2026.05.018_b4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.7151\/dmgt.1438","article-title":"Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles","volume":"29","author":"Cranston","year":"2009","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.018_b5","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"},{"key":"10.1016\/j.dam.2026.05.018_b6","doi-asserted-by":"crossref","first-page":"375","DOI":"10.3390\/axioms13060375","article-title":"Edge DP-coloring in K4 -minor free graphs and planar graphs","volume":"13","author":"He","year":"2024","journal-title":"Axioms"},{"issue":"1","key":"10.1016\/j.dam.2026.05.018_b7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.7151\/dmgt.2183","article-title":"List edge coloring of planar graphs without 6-cycles with two chords","volume":"41","author":"Hu","year":"2021","journal-title":"Discuss. Math. Graph Theory"},{"issue":"20","key":"10.1016\/j.dam.2026.05.018_b8","doi-asserted-by":"crossref","first-page":"2158","DOI":"10.1016\/j.disc.2011.06.031","article-title":"Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles","volume":"311","author":"Li","year":"2011","journal-title":"Discrete Math."},{"issue":"5","key":"10.1016\/j.dam.2026.05.018_b9","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.disc.2012.11.026","article-title":"Sufficient conditions for a planar graph to be list edge \u0394-colorable and list totally (\u0394+1)-colorable","volume":"313","author":"Lu","year":"2013","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.dam.2026.05.018_b10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1017\/S0963548301004576","article-title":"Structural properties and edge choosability of planar graphs without 6-cycles","volume":"10","author":"Wang","year":"2001","journal-title":"Combin. Probab. Comput."},{"issue":"5","key":"10.1016\/j.dam.2026.05.018_b11","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0893-9659(02)80007-6","article-title":"Choosability and edge choosability of planar graphs without five cycles","volume":"15","author":"Wang","year":"2002","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"10.1016\/j.dam.2026.05.018_b12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s10878-018-0280-z","article-title":"Minimum choosability of planar graphs","volume":"36","author":"Wang","year":"2018","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10.1016\/j.dam.2026.05.018_b13","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/s10878-015-9870-1","article-title":"List edge and list total coloring of planar graphs with maximum degree 8","volume":"32","author":"Wang","year":"2016","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10.1016\/j.dam.2026.05.018_b14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10878-018-00376-9","article-title":"Optimal channel assignment with list-edge coloring","volume":"38","author":"Wang","year":"2019","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10.1016\/j.dam.2026.05.018_b15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10114-013-2419-2","article-title":"A note on list edge and list total coloring of planar graphs without adjacent short cycles","volume":"30","author":"Wang","year":"2014","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"issue":"2","key":"10.1016\/j.dam.2026.05.018_b16","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10878-017-0193-2","article-title":"List-edge-coloring of planar graphs without 6-cycles with three chords","volume":"35","author":"Wang","year":"2018","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10.1016\/j.dam.2026.05.018_b17","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1007\/s10878-014-9805-2","article-title":"A note on the minimum number of choosability of planar graphs","volume":"31","author":"Wang","year":"2016","journal-title":"J. Comb. Optim."},{"issue":"5","key":"10.1016\/j.dam.2026.05.018_b18","article-title":"Edge DP-coloring in planar graphs","volume":"344","author":"Zhang","year":"2021","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"10.1016\/j.dam.2026.05.018_b19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.disc.2004.01.001","article-title":"Edge choosability of planar graphs without small cycles","volume":"283","author":"Zhang","year":"2004","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600301X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600301X?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:02Z","timestamp":1781460482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X2600301X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":19,"alternative-id":["S0166218X2600301X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.018","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":"Weak-strict degeneracy on line graphs of planar 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.018","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"}]}}