{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:07:23Z","timestamp":1775052443474,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T00:00:00Z","timestamp":1552521600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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-02028-z","type":"journal-article","created":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T20:37:34Z","timestamp":1552682254000},"page":"707-718","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable"],"prefix":"10.1007","volume":"35","author":[{"given":"Seog-Jin","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,14]]},"reference":[{"key":"2028_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1002\/1098-2418(200007)16:4<364::AID-RSA5>3.0.CO;2-0","volume":"16","author":"N Alon","year":"2000","unstructured":"Alon, N.: Degrees and choice numbers. Random Struct. Algorithms 16, 364\u2013368 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"2028_CR2","doi-asserted-by":"publisher","first-page":"2680","DOI":"10.1016\/j.disc.2016.05.012","volume":"339","author":"A Bernshteyn","year":"2016","unstructured":"Bernshteyn, A.: The asymptotic behavior of the correspondence chromatic number. Discret. Math. 339, 2680\u20132692 (2016)","journal-title":"Discret. Math."},{"key":"2028_CR3","unstructured":"Bernshteyn, A., Kostochka, A.: On differences between DP-coloring and list coloring. \n                    arXiv:1705.04883v2"},{"key":"2028_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":"2028_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.ejc.2017.05.007","volume":"65","author":"A Bernshteyn","year":"2017","unstructured":"Bernshteyn, A., Kostochka, A., Zhu, X.: DP-colorings of graphs with high chromatic number. Eur. J. Comb. 65, 122\u2013129 (2017)","journal-title":"Eur. J. Comb."},{"issue":"12","key":"2028_CR6","doi-asserted-by":"publisher","first-page":"3052","DOI":"10.1016\/j.disc.2016.06.009","volume":"339","author":"P Cheng","year":"2016","unstructured":"Cheng, P., Chen, M., Wang, Y.: Planar graphs without 4-cycles adjacent to triangles are 4-choosable. Discret. Math. 339(12), 3052\u20133057 (2016)","journal-title":"Discret. Math."},{"key":"2028_CR7","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":"2028_CR8","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State University, Arcata, California, 1979), pp. 125\u2013157, Congress. Numer., XXVI, Utilitas Mathematica Publishing Inc. Winnipeg, Manitoba (1980)"},{"key":"2028_CR9","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.ejc.2015.10.001","volume":"52","author":"L Jin","year":"2016","unstructured":"Jin, L., Kang, Y., Steffen, E.: Choosability in signed planar graphs. Eur. J. Comb. 52, 234\u2013243 (2016)","journal-title":"Eur. J. Comb."},{"key":"2028_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22425","author":"S-J Kim","year":"2018","unstructured":"Kim, S.-J., Ozeki, K.: A note on a Brooks\u2019 type theorem for DP-coloring. J. Graph Theory (2018). \n                    https:\/\/doi.org\/10.1002\/jgt.22425","journal-title":"J. Graph Theory"},{"issue":"7","key":"2028_CR11","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. Discret. Math. 341(7), 1983\u20131986 (2018)","journal-title":"Discret. Math."},{"issue":"1","key":"2028_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/jctb.1998.1893","volume":"76","author":"PC-B Lam","year":"1999","unstructured":"Lam, P.C.-B., Xu, B., Liu, J.: The 4-choosability of plane graphs without 4-cycles. J. Comb. Theory Ser. B 76(1), 117\u2013126 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2028_CR13","doi-asserted-by":"crossref","first-page":"#P1.14","DOI":"10.37236\/4938","volume":"23","author":"E M\u00e1\u010dajov\u00e1","year":"2016","unstructured":"M\u00e1\u010dajov\u00e1, E., Raspaud, A., \u0160koviera, M.: The chromatic number of a signed graph. Electron. J. Comb. 23, #P1.14 (2016)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"2028_CR14","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(1), 180\u2013181 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2028_CR15","first-page":"3","volume":"29","author":"VG Vizing","year":"1976","unstructured":"Vizing, V.G.: Vertex colorings with given colors (in Russian). Diskret. Analiz. 29, 3\u201310 (1976)","journal-title":"Diskret. Analiz."},{"key":"2028_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0012-365X(94)00180-9","volume":"146","author":"M Voigt","year":"1995","unstructured":"Voigt, M.: A not 3-choosable planar graph without 3-cycles. Discret. Math. 146, 325\u2013328 (1995)","journal-title":"Discret. Math."},{"key":"2028_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(82)90144-3","volume":"39","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graph coloring. Discret. Math. 39, 215\u2013228 (1982)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02028-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02028-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02028-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T00:42:15Z","timestamp":1584060135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02028-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,14]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["2028"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02028-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,14]]},"assertion":[{"value":"7 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}