{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:14Z","timestamp":1740107114745,"version":"3.37.3"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11971438"],"award-info":[{"award-number":["11971438"]}],"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":[[2022,12]]},"DOI":"10.1007\/s00373-022-02575-y","type":"journal-article","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T11:23:39Z","timestamp":1665573819000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multiple DP-Coloring of Planar Graphs Without 3-Cycles and Normally Adjacent 4-Cycles"],"prefix":"10.1007","volume":"38","author":[{"given":"Huan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5502-5390","authenticated-orcid":false,"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"2575_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0012-365X(96)00159-8","volume":"165\/166","author":"N Alon","year":"1997","unstructured":"Alon, N., Tuza, Zs., Voigt, M.: Choosability and fractional chromatic numbers. Discrete Math. 165\/166, 31\u201338 (1997). (Graphs and combinatorics (Marseille, 1995))","journal-title":"Discrete Math."},{"key":"2575_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/jgt.22482","volume":"93","author":"A Bernshteyn","year":"2020","unstructured":"Bernshteyn, A., Kostochka, A., Zhu, X.: Fractional DP-colorings of sparse graphs. J. Graph Theory 93, 203\u2013221 (2020)","journal-title":"J. Graph Theory"},{"key":"2575_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jctb.2018.04.002","volume":"133","author":"D Cranston","year":"2018","unstructured":"Cranston, D., Rabern, L.: Planar graphs are 9\/2-colorable. J. Combin. Theory Ser. B 133, 32\u201345 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2575_CR4","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":"2575_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.dam.2021.02.008","volume":"294","author":"M Han","year":"2021","unstructured":"Han, M., Kierstead, H.A., Zhu, X.: Every planar graph is 1-defective (9,2)-paintable. Discrete Appl. Math. 294, 257\u2013264 (2021)","journal-title":"Discrete Appl. Math."},{"key":"2575_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.jctb.2018.12.004","volume":"137","author":"Y Jiang","year":"2019","unstructured":"Jiang, Y., Zhu, X.: Multiple list colouring triangle free planar graphs. J. Combin. Theory Ser. B 137, 112\u2013117 (2019)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2575_CR7","doi-asserted-by":"publisher","unstructured":"Xu, R., Zhu, X.: The strong fractional choice number and the strong fractional paint number of graphs. https:\/\/doi.org\/10.48550\/arXiv.2110.00906","DOI":"10.48550\/arXiv.2110.00906"},{"key":"2575_CR8","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.jctb.2016.09.008","volume":"122","author":"X Zhu","year":"2017","unstructured":"Zhu, X.: Multiple list colouring of planar graphs. J. Combin. Theory Ser. B 122, 794\u2013799 (2017)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02575-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02575-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02575-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T19:26:59Z","timestamp":1670614019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02575-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,12]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2575"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02575-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,10,12]]},"assertion":[{"value":"16 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2022","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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"170"}}