{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T05:23:58Z","timestamp":1754112238481,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T00:00:00Z","timestamp":1554854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"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":[[2019,7]]},"DOI":"10.1007\/s00373-019-02038-x","type":"journal-article","created":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T19:41:16Z","timestamp":1554925276000},"page":"837-845","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring"],"prefix":"10.1007","volume":"35","author":[{"given":"Pongpat","family":"Sittitrai","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":[[2019,4,10]]},"reference":[{"issue":"1","key":"2038_CR1","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(1), 28\u201336 (2017)","journal-title":"Sib. Math. J."},{"key":"2038_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.dam.2013.09.009","volume":"162","author":"M Chen","year":"2014","unstructured":"Chen, M., Raspaud, A.: On (3, 1)*-choosability of planar graphs without adjacent short cycles. Discrete Appl. Math. 162, 159\u2013166 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"2038_CR3","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s10878-015-9913-7","volume":"32","author":"M Chen","year":"2016","unstructured":"Chen, M., Raspaud, A., Wang, W.: A (3, 1)*-choosable theorem on planar graphs. J. Comput. Optim. 32(3), 927\u2013940 (2016)","journal-title":"J. Comput. Optim."},{"issue":"2","key":"2038_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"L Cowen","year":"1986","unstructured":"Cowen, L., Cowen, R., Woodall, D.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10(2), 187\u2013195 (1986)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2038_CR5","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.dam.2008.06.023","volume":"157","author":"W Dong","year":"2009","unstructured":"Dong, W., Xu, B.: A note on list improper coloring of plane graphs. Discrete Appl. Math. 157(2), 433\u2013436 (2009)","journal-title":"Discrete Appl. Math."},{"key":"2038_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":"2038_CR7","first-page":"79","volume":"25","author":"E Eaton","year":"1999","unstructured":"Eaton, E., Hull, T.: Defective list colorings of planar graphs. Bull. Inst. Combin. Appl. 25, 79\u201387 (1999)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"2038_CR8","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)"},{"issue":"7","key":"2038_CR9","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-\n                    \n                      \n                    \n                    $$4$$\n                    \n                      \n                        \n                          4\n                        \n                      \n                    \n                  -colorability. Discrete Math. 341(7), 1983\u20131986 (2018)","journal-title":"Discrete Math."},{"key":"2038_CR10","unstructured":"Kim, S.-J., Yu, X.: Planar graphs without \n                    \n                      \n                    \n                    $$4$$\n                    \n                      \n                        \n                          4\n                        \n                      \n                    \n                  -cycles adjacent to triangles are DP-\n                    \n                      \n                    \n                    $$4$$\n                    \n                      \n                        \n                          4\n                        \n                      \n                    \n                  -colorable (2017). \n                    arXiv:1712.08999"},{"issue":"3","key":"2038_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0893-9659(00)00147-6","volume":"14","author":"K Lih","year":"2001","unstructured":"Lih, K., Song, Z., Wang, W., Zhang, K.: A note on list improper coloring planar graphs. Appl. Math. Lett. 14(3), 269\u2013273 (2001)","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"2038_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1017\/S0963548399003752","volume":"8","author":"R \u0160krekovski","year":"1999","unstructured":"\u0160krekovski, R.: List improper colourings of planar graphs. Combin. Probab. Comput. 8(3), 293\u2013299 (1999)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"2038_CR13","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 \n                    \n                      \n                    \n                    $$5$$\n                    \n                      \n                        \n                          5\n                        \n                      \n                    \n                  -choosable. J. Combin. Theory Ser. B 62(1), 180\u2013181 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2038_CR14","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)","journal-title":"Metody Diskret. Analiz."},{"issue":"1\u20133","key":"2038_CR15","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(1\u20133), 215\u2013219 (1993)","journal-title":"Discrete Math."},{"issue":"4","key":"2038_CR16","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1137\/120885140","volume":"27","author":"Y Wang","year":"2013","unstructured":"Wang, Y., Xu, L.: Improper choosability of planar graphs without 4-cycles. SIAM J. Discrete Math. 27(4), 2029\u20132037 (2013)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02038-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02038-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02038-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T23:38:45Z","timestamp":1586389125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02038-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,10]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["2038"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02038-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,4,10]]},"assertion":[{"value":"27 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}