{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:07:27Z","timestamp":1775052447098,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T00:00:00Z","timestamp":1551916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-16-1-0316"],"award-info":[{"award-number":["H98230-16-1-0316"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11728102"],"award-info":[{"award-number":["11728102"]}],"id":[{"id":"10.13039\/501100001809","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":[[2019,5]]},"DOI":"10.1007\/s00373-019-02025-2","type":"journal-article","created":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T19:21:51Z","timestamp":1551986511000},"page":"695-705","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["DP-3-Coloring of Planar Graphs Without 4,\u00a09-Cycles and Cycles of Two Lengths from \n                \n                  \n                \n                $$\\{6,7,8\\}$$\n                \n                  \n                    \n                      {\n                      6\n                      ,\n                      7\n                      ,\n                      8\n                      }"],"prefix":"10.1007","volume":"35","author":[{"given":"Runrun","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah","family":"Loeb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Rolek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxue","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5898-7344","authenticated-orcid":false,"given":"Gexin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,7]]},"reference":[{"key":"2025_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":"2025_CR2","doi-asserted-by":"crossref","unstructured":"Bernshteyn, A., Kostochka, A.: On differences between DP-coloring and list coloring (2019). \n                    arXiv:1705.04883\n                    \n                  \n                           (Preprint)","DOI":"10.3103\/S1055134419030039"},{"key":"2025_CR3","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. Comb. Theory Ser. B 129, 38\u201354 (2018)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2025_CR4","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs, Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. XXVI, pp. 125\u2013157 (1979)"},{"key":"2025_CR5","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.disc.2018.10.025","volume":"342","author":"R Liu","year":"2019","unstructured":"Liu, R., Li, X.: Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. Discrete Math. 342, 623\u2013627 (2019)","journal-title":"Discrete Math."},{"issue":"1","key":"2025_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.disc.2018.09.025","volume":"342","author":"R Liu","year":"2019","unstructured":"Liu, R., Loeb, S., Yin, Y., Yu, G.: DP-3-coloring of some planar graphs. Discrete Math. 342(1), 178\u2013189 (2019)","journal-title":"Discrete Math."},{"key":"2025_CR7","unstructured":"Kim, S.-J., Ozeki, K.: A note on a Brooks type theorem for DP-coloring (2019). \n                    arXiv:1709.09807\n                    \n                  \n                           (preprint)"},{"key":"2025_CR8","doi-asserted-by":"crossref","unstructured":"Kim, S.-J., Yu, X.: Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (2019). \n                    arXiv:1712.08999\n                    \n                  \n                           (preprint)","DOI":"10.1007\/s00373-019-02028-z"},{"key":"2025_CR9","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ipl.2007.06.005","volume":"104","author":"L Shen","year":"2007","unstructured":"Shen, L., Wang, Y.: A sufficient condition for a planar graph to be \n                    \n                      \n                    \n                    $$3$$\n                    \n                      \n                        \n                          3\n                        \n                      \n                    \n                  -choosable. Inf. Process. Lett. 104, 146\u2013151 (2007)","journal-title":"Inf. Process. Lett."},{"key":"2025_CR10","unstructured":"Sittitrai, P., Nakprasit, K.: Every planar graph without \n                    \n                      \n                    \n                    $$i$$\n                    \n                      \n                        i\n                      \n                    \n                  -cycles adjacent simultaneously to \n                    \n                      \n                    \n                    $$j$$\n                    \n                      \n                        j\n                      \n                    \n                  -cycles and \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -cycles is DP-4-colorable when \n                    \n                      \n                    \n                    $$\\{i,j,k\\}=\\{3,4,5\\}$$\n                    \n                      \n                        \n                          {\n                          i\n                          ,\n                          j\n                          ,\n                          k\n                          }\n                          =\n                          {\n                          3\n                          ,\n                          4\n                          ,\n                          5\n                          }\n                        \n                      \n                    \n                   (2019). \n                    arXiv:1801.06760\n                    \n                  \n                           (preprint)"},{"key":"2025_CR11","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. Comb. Theory Ser. B 62, 180\u2013181 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2025_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/jctb.1995.1027","volume":"64","author":"C Thomassen","year":"1995","unstructured":"Thomassen, C.: 3-list-coloring planar graphs of girth 5. J. Comb. Theory Ser. B 64, 101\u2013107 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2025_CR13","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.dam.2010.11.002","volume":"159","author":"Y Wang","year":"2011","unstructured":"Wang, Y., Shen, L.: Planar graphs without cycles of length \n                    \n                      \n                    \n                    $$4,7,8$$\n                    \n                      \n                        \n                          4\n                          ,\n                          7\n                          ,\n                          8\n                        \n                      \n                    \n                   or \n                    \n                      \n                    \n                    $$9$$\n                    \n                      \n                        \n                          9\n                        \n                      \n                    \n                   are \n                    \n                      \n                    \n                    $$3$$\n                    \n                      \n                        \n                          3\n                        \n                      \n                    \n                  -choosable. Discrete Appl. Math. 159, 232\u2013239 (2011)","journal-title":"Discrete Appl. Math."},{"key":"2025_CR14","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.ipl.2007.08.027","volume":"105","author":"Y Whang","year":"2008","unstructured":"Whang, Y., Lu, H., Chen, M.: A note on \n                    \n                      \n                    \n                    $$3$$\n                    \n                      \n                        \n                          3\n                        \n                      \n                    \n                  -choosability of planar graphs. Inf. Process. Lett. 105, 206\u2013211 (2008)","journal-title":"Inf. Process. Lett."},{"key":"2025_CR15","first-page":"3","volume":"29","author":"VG Vizing","year":"1976","unstructured":"Vizing, V.G.: Vertex colorings with given colors (in Russian). Diskret. Anal. 29, 3\u201310 (1976)","journal-title":"Diskret. Anal."},{"key":"2025_CR16","doi-asserted-by":"crossref","unstructured":"Yin, Y., Yu, G.: Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (2019). \n                    arXiv:1809.00925\n                    \n                  \n                           (preprint)","DOI":"10.1016\/j.disc.2019.05.014"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02025-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02025-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02025-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:17:42Z","timestamp":1583453862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02025-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,7]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["2025"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02025-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,7]]},"assertion":[{"value":"20 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}