{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:06:38Z","timestamp":1775052398750,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T00:00:00Z","timestamp":1588982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T00:00:00Z","timestamp":1588982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100012527","name":"Office of the Higher Education Commission","doi-asserted-by":"publisher","award":["RSA6180049"],"award-info":[{"award-number":["RSA6180049"]}],"id":[{"id":"10.13039\/100012527","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004396","name":"Thailand Research Fund","doi-asserted-by":"publisher","award":["RSA6180049"],"award-info":[{"award-number":["RSA6180049"]}],"id":[{"id":"10.13039\/501100004396","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00373-020-02177-6","type":"journal-article","created":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T04:02:48Z","timestamp":1588996968000},"page":"1189-1201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Generalization of Some Results on List Coloring and DP-Coloring"],"prefix":"10.1007","volume":"36","author":[{"given":"Keaitsuda Maneeruk","family":"Nakprasit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0421-3631","authenticated-orcid":false,"given":"Kittikorn","family":"Nakprasit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,9]]},"reference":[{"key":"2177_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12, 125\u2013134 (1992)","journal-title":"Combinatorica"},{"key":"2177_CR2","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1215\/ijm\/1256049898","volume":"20","author":"K Appel","year":"1976","unstructured":"Appel, K., Haken, W.: The existence of unavoidable sets of geographically good configuration. Ill. J. Math. 20, 218\u2013297 (1976)","journal-title":"Ill. J. Math."},{"key":"2177_CR3","unstructured":"Bernshteyn, A., Kostochka, A.: On differences between DP-coloring and list coloring. arXiv:1705.04883(preprint)"},{"key":"2177_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1134\/S0037446617010049","volume":"58","author":"A Bernshteyn","year":"2017","unstructured":"Bernshteyn, A., Kostochka, A., Pron, S.: On DP-coloring of graphs and multigraphs. Sib. Math. J. 58, 28\u201336 (2017)","journal-title":"Sib. Math. J."},{"key":"2177_CR5","first-page":"211","volume":"5","author":"OV Borodin","year":"2008","unstructured":"Borodin, O.V., Ivanova, A.O.: List 2-arboricity of planar graphs with no triangles at distance less than two. Sib. Elektron. Mat. Izv. 5, 211\u2013214 (2008)","journal-title":"Sib. Elektron. Mat. Izv."},{"key":"2177_CR6","first-page":"75","volume":"5","author":"OV Borodin","year":"2008","unstructured":"Borodin, O.V., Ivanova, A.O.: Planar graphs without triangular $$4$$-cycles are $$4$$-choosable. Sib. \u00c8lektron. Mat. Rep. 5, 75\u201379 (2008)","journal-title":"Sib. \u00c8lektron. Mat. Rep."},{"key":"2177_CR7","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1002\/jgt.20394","volume":"62","author":"OV Borodin","year":"2009","unstructured":"Borodin, O.V., Ivanova, A.O.: Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable. J. Graph Theory 62, 234\u2013240 (2009)","journal-title":"J. Graph Theory"},{"key":"2177_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(99)00221-6","volume":"214","author":"OV Borodin","year":"2000","unstructured":"Borodin, O.V., Kostochka, A.V., Toft, B.: Variable degeneracy: extensions of Brooks and Gallai\u2019s theorems. Discrete Math. 214, 101\u2013112 (2000)","journal-title":"Discrete Math."},{"key":"2177_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10878-017-0168-3","volume":"35","author":"H Cai","year":"2018","unstructured":"Cai, H., Wu, J.-L., Sun, L.: Vertex arboricity of planar graphs without intersecting 5-cycles. J. Combin. Optim. 35, 365\u2013372 (2018)","journal-title":"J. Combin. Optim."},{"key":"2177_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02760181","volume":"6","author":"G Chartrand","year":"1968","unstructured":"Chartrand, G., Kronk, H.V., Wall, C.E.: The point-arboricity of a graph. Isr. J. Math. 6, 169\u2013175 (1968)","journal-title":"Isr. J. Math."},{"key":"2177_CR11","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1112\/jlms\/s1-44.1.612","volume":"44","author":"G Chartrand","year":"1969","unstructured":"Chartrand, G., Kronk, H.V.: The point-arboricity of planar graphs. J. Lond. Math. Soc. 44, 612\u2013616 (1969)","journal-title":"J. Lond. Math. Soc."},{"key":"2177_CR12","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1016\/j.ejc.2011.09.017","volume":"33","author":"M Chen","year":"2012","unstructured":"Chen, M., Raspaud, A., Wang, W.: Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Combin. 33, 905\u2013923 (2012)","journal-title":"Eur. J. Combin."},{"key":"2177_CR13","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":"2177_CR14","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, Sept. 5\u20137, Congr. Numer., vol. 26 (1979)"},{"key":"2177_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"2177_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/0402007","volume":"2","author":"SL Hakimi","year":"1989","unstructured":"Hakimi, S.L., Schmeichel, E.F.: A note on the vertex arboricity of a graph. SIAM J. Discrete Math. 2, 64\u201367 (1989)","journal-title":"SIAM J. Discrete Math."},{"key":"2177_CR17","doi-asserted-by":"publisher","first-page":"2304","DOI":"10.1016\/j.disc.2012.03.035","volume":"312","author":"D Huang","year":"2012","unstructured":"Huang, D., Shiu, W.C., Wang, W.: On the vertex-arboricity of planar graphs without 7-cycles. Discrete Math. 312, 2304\u20132315 (2012)","journal-title":"Discrete Math."},{"key":"2177_CR18","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1080\/00207160.2012.727989","volume":"90","author":"D Huang","year":"2013","unstructured":"Huang, D., Wang, W.: Vertex arboricity of planar graphs without chordal 6-cycles. Int. J. Comput. Math. 90, 258\u2013272 (2013)","journal-title":"Int. J. Comput. Math."},{"key":"2177_CR19","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1016\/j.disc.2018.03.027","volume":"341","author":"S-J Kim","year":"2018","unstructured":"Kim, S.-J., Ozeki, K.: A sufficient condition for DP-$$4$$-colorability. Discrete Math. 341, 1983\u20131986 (2018)","journal-title":"Discrete Math."},{"issue":"3","key":"2177_CR20","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00373-019-02028-z","volume":"35","author":"S-J Kim","year":"2019","unstructured":"Kim, S.-J., Yu, X.: Planar graphs without $$4$$-cycles adjacent to triangles are DP-$$4$$-colorable. Graphs Combin. 35(3), 707\u2013718 (2019)","journal-title":"Graphs Combin."},{"key":"2177_CR21","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.ejc.2007.11.022","volume":"29","author":"A Raspaud","year":"2008","unstructured":"Raspaud, A., Wang, W.: On the vertex-arboricity of planar graphs. Eur. J. Combin. 29, 1064\u20131075 (2008)","journal-title":"Eur. J. Combin."},{"issue":"3","key":"2177_CR22","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00373-019-02025-2","volume":"35","author":"R Liu","year":"2019","unstructured":"Liu, R., Loeb, S., Rolek, M., Yin, Y., Yu, G.: DP-3-coloring of planar graphs without $$4$$, $$9$$-cycles and cycles of two lengths from $$\\{6, 7, 8\\}$$. Graphs Combin. 35(3), 695\u2013705 (2019)","journal-title":"Graphs Combin."},{"key":"2177_CR23","doi-asserted-by":"crossref","unstructured":"Sittitrai, P., Nakprasit, K.: Analogue of DP-coloring on variable degeneracy and its applications (2020) (in press)","DOI":"10.7151\/dmgt.2238"},{"key":"2177_CR24","doi-asserted-by":"publisher","unstructured":"Sittitrai, P., Nakprasit, K.: Every planar graph without pairwise adjacent $$3$$-, $$4$$-, and $$5$$-cycle is DP-$$4$$-colorable. Bull. Malays. Math. Sci. Soc. (2019). https:\/\/doi.org\/10.1007\/s40840-019-00800-1","DOI":"10.1007\/s40840-019-00800-1"},{"key":"2177_CR25","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C Thomassen","year":"1994","unstructured":"Thomassen, C.: Every planar graph is $$5$$-choosable. J. Combin. Theory Ser. B 62, 180\u2013181 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2177_CR26","first-page":"3","volume":"29","author":"VG Vizing","year":"1976","unstructured":"Vizing, V.G.: Vertex colorings with given colors. Metody Diskret. Analiz. 29, 3\u201310 (1976). (in Russian)","journal-title":"Metody Diskret. Analiz."},{"key":"2177_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(93)90579-I","volume":"120","author":"M Voigt","year":"1993","unstructured":"Voigt, M.: List colourings of planar graphs. Discrete Math. 120, 215\u2013219 (1993)","journal-title":"Discrete Math."},{"key":"2177_CR28","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BF02764717","volume":"14","author":"G Wegner","year":"1973","unstructured":"Wegner, G.: Note on a paper by B. Gr\u00fcnbaum on acyclic colorings. Isr. J. Math. 14, 409\u2013412 (1973)","journal-title":"Isr. J. Math."},{"issue":"2","key":"2177_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793830912500279","volume":"4","author":"N Xue","year":"2012","unstructured":"Xue, N., Wu, B.: List point arboricity of graphs. Discrete Math. Algorithms Appl. 4(2), 1\u201310 (2012)","journal-title":"Discrete Math. Algorithms Appl."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02177-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02177-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02177-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T23:35:08Z","timestamp":1620516908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02177-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,9]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["2177"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02177-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,9]]},"assertion":[{"value":"9 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}