{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:52Z","timestamp":1748404912783,"version":"3.41.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100024597","name":"Office of the Permanent Secretary, Ministry of Higher Education, Science, Research and Innovation","doi-asserted-by":"crossref","award":["RGNS 64-033"],"award-info":[{"award-number":["RGNS 64-033"]}],"id":[{"id":"10.13039\/501100024597","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00373-024-02857-7","type":"journal-article","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T06:54:33Z","timestamp":1733122473000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sufficient Conditions make Graphs Edge DP-$$\\varDelta $$-Colorable"],"prefix":"10.1007","volume":"41","author":[{"given":"Watcharintorn","family":"Ruksasakchai","sequence":"first","affiliation":[]},{"given":"Pongpat","family":"Sittitrai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,2]]},"reference":[{"issue":"3","key":"2857_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3103\/S1055134419030039","volume":"29","author":"A Bernshteyn","year":"2019","unstructured":"Bernshteyn, A., Kostochka, A.V.: On the differences between a DP-coloring and a list coloring. Sib. Adv. Math. 29(3), 183\u2013189 (2019)","journal-title":"Sib. Adv. Math."},{"issue":"3","key":"2857_CR2","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1137\/130927449","volume":"29","author":"M Bonamy","year":"2015","unstructured":"Bonamy, M.: Planar graphs with $$\\Delta \\ge 8$$ are $$(\\Delta +1)$$-edge-choosable. SIAM J. Discrete Math. 29(3), 1735\u20131763 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"2857_CR3","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1007\/BF01240258","volume":"48","author":"OV Borodin","year":"1990","unstructured":"Borodin, O.V.: A generalization of Kotzig\u2019s theorem and prescribed edge coloring of planar graphs. Math. Notes 48(6), 1186\u20131190 (1990). (in Russian)","journal-title":"Math. Notes"},{"issue":"2","key":"2857_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/jctb.1997.1780","volume":"71","author":"OV Borodin","year":"1997","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: List edge and list total colourings of multigraphs. J. Combin. Theory Ser. B 71(2), 184\u2013204 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2857_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.7151\/dmgt.1438","volume":"29","author":"DW Cranston","year":"2009","unstructured":"Cranston, D.W.: Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Discuss. Math. Graph Theory 29(1), 163\u2013178 (2009)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2857_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jctb.2017.09.001","volume":"129","author":"Z Dvo\u0159\u00e1k","year":"2018","unstructured":"Dvo\u0159\u00e1k, Z., Postle, L.: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths $$4$$ to $$8$$. J. Combin. Theory Ser. B 129, 38\u201354 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2857_CR7","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs, in: Proceedings, West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, CA., Sept. 5-7, in: Congr. Numer. 26 (1979)"},{"issue":"1","key":"2857_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/jctb.1995.1011","volume":"63","author":"F Galvin","year":"1995","unstructured":"Galvin, F.: The list chromatic index of a bipartite multigraph. J. Combin. Theory Ser. B 63(1), 153\u2013158 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"2857_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1017\/S0963548397002927","volume":"6","author":"R H\u00e4ggkvist","year":"1997","unstructured":"H\u00e4ggkvist, R., Janssen, J.: New bounds on the list-chromatic index of the complete graph and other simple graphs. Combin. Probab. Comput. 6(3), 295\u2013313 (1997)","journal-title":"Combin. Probab. Comput."},{"key":"2857_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.7151\/dmgt.2183","volume":"41","author":"L Hu","year":"2021","unstructured":"Hu, L., Sun, L., Wu, J.-L.: List edge coloring of planar graphs without 6-cycles with two chords. Discuss. Math. Graph Theory. 41, 199\u2013211 (2021)","journal-title":"Discuss. Math. Graph Theory."},{"issue":"1\u20133","key":"2857_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0012-365X(97)00230-6","volume":"187","author":"M Juvan","year":"1998","unstructured":"Juvan, M., Mohar, B., \u0160krekovski, R.: On list edge-colorings of subcubic graphs. Discrete Math. 187(1\u20133), 137\u2013149 (1998)","journal-title":"Discrete Math."},{"issue":"3","key":"2857_CR12","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<250::AID-JGT5>3.0.CO;2-R","volume":"32","author":"M Juvan","year":"1999","unstructured":"Juvan, M., Mohar, B., \u0160krekovski, R.: Graphs of degree $$4$$ are $$5$$-edge-choosable. J. Graph Theory 32(3), 250\u2013264 (1999)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2857_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jctb.2001.2047","volume":"83","author":"DP Sanders","year":"2001","unstructured":"Sanders, D.P., Zhao, Y.: Planar graphs of maximum degree seven are class I. J. Combin. Theory Ser. B 83(2), 201\u2013212 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"23","key":"2857_CR14","doi-asserted-by":"publisher","first-page":"5789","DOI":"10.1016\/j.disc.2007.09.048","volume":"308","author":"Y Shen","year":"2008","unstructured":"Shen, Y., Zheng, G., He, W., Zhao, Y.: Structural properties and edge choosability of planar graphs without 4-cycles. Discrete Math. 308(23), 5789\u20135794 (2008)","journal-title":"Discrete Math."},{"key":"2857_CR15","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a $$p$$-graph. Diskret. Analiz. 3, 25\u201330 (1964). (in Russian)","journal-title":"Diskret. Analiz."},{"key":"2857_CR16","first-page":"9","volume":"5","author":"VG Vizing","year":"1965","unstructured":"Vizing, V.G.: Critical graphs with given chromatic class. Diskret. Analiz. 5, 9\u201317 (1965). (in Russian)","journal-title":"Diskret. Analiz."},{"key":"2857_CR17","first-page":"3","volume":"29","author":"VG Vizing","year":"1976","unstructured":"Vizing, V.G.: Coloring the vertices of a graph in prescribed colors. Diskret. Analiz. 29, 3\u201310 (1976). (in Russian)","journal-title":"Diskret. Analiz."},{"issue":"1","key":"2857_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/eujc.2000.0430","volume":"22","author":"W Wang","year":"2001","unstructured":"Wang, W., Lih, K.-W.: Choosability, edge choosability, and total choosability of outerplane graphs. Eur. J. Combin. 22(1), 71\u201378 (2001)","journal-title":"Eur. J. Combin."},{"issue":"3","key":"2857_CR19","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1017\/S0963548301004576","volume":"10","author":"W Wang","year":"2001","unstructured":"Wang, W., Lih, K.-W.: Structural properties and edge choosability of planar graphs without 6-cycles. Combin. Probab. Comput. 10(3), 267\u2013276 (2001)","journal-title":"Combin. Probab. Comput."},{"issue":"5","key":"2857_CR20","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/S0893-9659(02)80007-6","volume":"15","author":"W Wang","year":"2002","unstructured":"Wang, W., Lih, K.-W.: Choosability and edge choosability of planar graphs without five cycles. Appl. Math. Lett. 15(5), 561\u2013565 (2002)","journal-title":"Appl. Math. Lett."},{"issue":"4","key":"2857_CR21","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s003730070009","volume":"16","author":"L Zhang","year":"2000","unstructured":"Zhang, L.: Every planar graph with maximum degree 7 is of class 1. Graphs Combin. 16(4), 467\u2013495 (2000)","journal-title":"Graphs Combin."},{"issue":"5","key":"2857_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112314","volume":"344","author":"L Zhang","year":"2021","unstructured":"Zhang, L., Lum, Y., Zhang, S.: Edge DP-coloring in planar graphs. Discrete Math. 344(5), 112314 (2021)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"2857_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.disc.2004.01.001","volume":"283","author":"L Zhang","year":"2004","unstructured":"Zhang, L., Wu, B.: Edge choosability of planar graphs without small cycles. Discrete Math. 283(1\u20133), 289\u2013293 (2004)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02857-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02857-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02857-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:32Z","timestamp":1748319752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02857-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2857"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02857-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"3 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1"}}