{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T00:19:47Z","timestamp":1780100387685,"version":"3.54.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1266016"],"award-info":[{"award-number":["DMS-1266016"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1600390"],"award-info":[{"award-number":["DMS-1600390"]}],"id":[{"id":"10.13039\/100000001","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":[[2017,7]]},"DOI":"10.1007\/s00373-017-1812-5","type":"journal-article","created":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T07:16:43Z","timestamp":1497424603000},"page":"751-787","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["(4,\u00a02)-Choosability of Planar Graphs with Forbidden Structures"],"prefix":"10.1007","volume":"33","author":[{"given":"Zhanar","family":"Berikkyzy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"Cox","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Dairyko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kirsten","family":"Hogenson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohit","family":"Kumbhat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8612-3594","authenticated-orcid":false,"given":"Bernard","family":"Lidick\u00fd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kacy","family":"Messerschmidt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Moss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kathleen","family":"Nowak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin F.","family":"Palmowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Derrick","family":"Stolee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"issue":"2","key":"1812_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(2), 125\u2013134 (1992). doi:\n                    10.1007\/BF01204715","journal-title":"Combinatorica"},{"issue":"4","key":"1812_CR2","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.disc.2012.11.011","volume":"313","author":"OV Borodin","year":"2013","unstructured":"Borodin, O.V.: Colorings of Plane Graphs: A Survey. Discret. Math. 313(4), 517\u2013539 (2013). doi:\n                    10.1016\/j.disc.2012.11.011","journal-title":"Discret. Math."},{"key":"1812_CR3","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. \u00c9lektron. Mat. Izv. 5, 75\u201379 (2008)","journal-title":"Sib. \u00c9lektron. Mat. Izv."},{"issue":"3","key":"1812_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/jgt.21875","volume":"81","author":"I Choi","year":"2016","unstructured":"Choi, I., Lidick\u00fd, B., Stolee, D.: On Choosability with Separation of Planar Graphs with Forbidden Cycles. J. Graph Theory 81(3), 283\u2013306 (2016). doi:\n                    10.1002\/jgt.21875","journal-title":"J. Graph Theory"},{"issue":"4","key":"1812_CR5","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.disc.2016.11.022","volume":"340","author":"DW Cranston","year":"2017","unstructured":"Cranston, D.W., West, D.B.: An Introduction to the Discharging Method via Graph Coloring. Discret. Math. 340(4), 766\u2013793 (2017). doi:\n                    10.1016\/j.disc.2016.11.022","journal-title":"Discret. Math."},{"issue":"3","key":"1812_CR6","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1137\/05064477X","volume":"23","author":"B Farzad","year":"2009","unstructured":"Farzad, B.: Planar Graphs Without 7-Cycles are 4-Choosable. SIAM J. Discret. Math. 23(3), 1179\u20131199 (2009). doi:\n                    10.1137\/05064477X","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"1812_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1006\/eujc.2002.0570","volume":"23","author":"G Fijav\u017e","year":"2002","unstructured":"Fijav\u017e, G., Juvan, M., Mohar, B., \u0160krekovski, R.: Planar Graphs Without Cycles of Specific Lengths. Eur. J. Combin. 23(4), 377\u2013388 (2002). doi:\n                    10.1006\/eujc.2002.0570","journal-title":"Eur. J. Combin."},{"issue":"10","key":"1812_CR8","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1016\/j.disc.2015.01.008","volume":"338","author":"HA Kierstead","year":"2015","unstructured":"Kierstead, H.A., Lidick\u00fd, B.: On Choosability with Separation of Planar Graphs with Lists of Different Sizes. Discrete Math. 338(10), 1779\u20131783 (2015). doi:\n                    10.1016\/j.disc.2015.01.008","journal-title":"Discrete Math."},{"key":"1812_CR9","doi-asserted-by":"publisher","unstructured":"Kratochv\u00edl, J., Tuza, Z., Voigt, M.: Brooks-type Theorems for Choosability with Separation. J. Graph Theory 27(1), 43\u201349 (1998). doi:\n                    10.1002\/(SICI)1097-0118(199801)27:1<43::AID-JGT7>3.3.CO;2-Q","DOI":"10.1002\/(SICI)1097-0118(199801)27:1%3c43::AID-JGT7%3e3.3.CO;2-Q"},{"issue":"1","key":"1812_CR10","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. Combin. Theory Ser. B 76(1), 117\u2013126 (1999). doi:\n                    10.1006\/jctb.1998.1893","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"1812_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. Combin. Theory Ser. B 62(1), 180\u2013181 (1994). doi:\n                    10.1006\/jctb.1994.1062","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20133","key":"1812_CR12","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. Discret. Math. 120(1\u20133), 215\u2013219 (1993). doi:\n                    10.1016\/0012-365X(93)90579-I","journal-title":"Discret. Math."},{"key":"1812_CR13","first-page":"169","volume":"58","author":"R \u0160krekovski","year":"2001","unstructured":"\u0160krekovski, R.: A Note on Choosability with Separation for Planar Graphs. Ars Combin. 58, 169\u2013174 (2001)","journal-title":"Ars Combin."},{"issue":"5","key":"1812_CR14","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/S0893-9659(02)80007-6","volume":"15","author":"W Wang","year":"2002","unstructured":"Wang, W., Lih, K.W.: Choosability and Edge Choosability Of Planar Graphs Without Five Cycles. Appl. Math. Lett. 15(5), 561\u2013565 (2002). doi:\n                    10.1016\/S0893-9659(02)80007-6","journal-title":"Appl. Math. Lett."},{"key":"1812_CR15","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1812-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1812-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1812-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:54:38Z","timestamp":1589446478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1812-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,14]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1812"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1812-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,14]]},"assertion":[{"value":"21 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}