{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:10Z","timestamp":1740107110153,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11971270"],"award-info":[{"award-number":["11971270"]}],"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,6]]},"DOI":"10.1007\/s00373-022-02480-4","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T16:05:32Z","timestamp":1647273932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Sufficient Conditions for Planar Graphs to be 5-Flexible"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1511-6586","authenticated-orcid":false,"given":"Fan","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"2480_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.: Graph Theory with Applications. Macmillan, London (1976)"},{"key":"2480_CR2","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. Electron. Math. Rep. 5, 75\u201379 (2008)","journal-title":"Sib. Electron. Math. Rep."},{"issue":"12","key":"2480_CR3","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. Discrete Math. 339(12), 3052\u20133057 (2016)","journal-title":"Discrete Math."},{"key":"2480_CR4","unstructured":"Choi, L., Clemen, F.C., Ferrara, M., Horn, P., Ma, F., Masa\u0159\u00edk, T.: Flexibility of planar graphs-sharpening the tools to get lists of size four (2020). arXiv:2004.10917"},{"key":"2480_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22634","author":"Z Dvo\u0159\u00e1k","year":"2020","unstructured":"Dvo\u0159\u00e1k, Z., Masa\u0159\u00edk, T., Mus\u00edlek, J., Pangr\u00e1c, O.: Flexibility of triangle-free planar graphs. J. Graph Theory (2020). https:\/\/doi.org\/10.1002\/jgt.22634","journal-title":"J. Graph Theory"},{"key":"2480_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22567","author":"Z Dvo\u0159\u00e1k","year":"2020","unstructured":"Dvo\u0159\u00e1k, Z., Masa\u0159\u00edk, T., Mus\u00edlek, J., Pangr\u00e1c, O.: Flexibility of planar graphs of girth at least six. J. Graph Theory (2020). https:\/\/doi.org\/10.1002\/jgt.22567","journal-title":"J. Graph Theory"},{"issue":"3","key":"2480_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/jgt.22447","volume":"92","author":"Z Dvo\u0159\u00e1k","year":"2019","unstructured":"Dvo\u0159\u00e1k, Z., Norin, S., Postle, L.: List coloring with requests. J. Graph Theory 92(3), 191\u2013206 (2019)","journal-title":"J. Graph Theory"},{"key":"2480_CR8","unstructured":"Erd\u00f6s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West-Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, California (Congr. Numer. XXVI), vol. 26, pp. 125\u2013157 (1980)"},{"issue":"1","key":"2480_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/jctb.1998.1893","volume":"76","author":"PCB 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"},{"issue":"3","key":"2480_CR10","first-page":"935","volume":"88","author":"T Masa\u0159\u00edk","year":"2019","unstructured":"Masa\u0159\u00edk, T.: Flexibility of planar graphs without 4-cycles. Acta Math. Univ. Comenian. 88(3), 935\u2013940 (2019)","journal-title":"Acta Math. Univ. Comenian."},{"issue":"1","key":"2480_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0095-8956(03)00029-7","volume":"88","author":"C Thomassen","year":"2003","unstructured":"Thomassen, C.: A short list color proof of Gr\u00f6tzsch$$^{\\prime }$$s theorem. J. Comb. Theory Ser. B 88(1), 189\u2013192 (2003)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"2480_CR12","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":"2480_CR13","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1016\/j.disc.2005.11.041","volume":"307","author":"M Voigt","year":"2007","unstructured":"Voigt, M.: A non-3-choosable planar graph without cycles of length 4 and 5. Discrete Math. 307, 1013\u20131015 (2007)","journal-title":"Discrete Math."},{"issue":"4","key":"2480_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/S0895480100376253","volume":"15","author":"W Wang","year":"2002","unstructured":"Wang, W., Lih, K.: Choosability and edge choosability of planar graphs without intersecting triangles. SIAM Discrete Math. 15(4), 538\u2013545 (2002)","journal-title":"SIAM Discrete Math."},{"key":"2480_CR15","unstructured":"Yang, D., Yang, F.: Flexibility of planar graphs without $$C_4$$ and $$C_5$$ (2020). arXiv:2006.05243"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02480-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02480-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02480-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:44:44Z","timestamp":1654814684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02480-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2480"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02480-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"10 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 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 have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"70"}}