{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:00Z","timestamp":1740122460245,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T00:00:00Z","timestamp":1521763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11201333"],"award-info":[{"award-number":["11201333"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10878-018-0280-z","type":"journal-article","created":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T04:13:07Z","timestamp":1521778387000},"page":"13-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum choosability of planar graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Huijuan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0710-8498","authenticated-orcid":false,"given":"Ling","family":"Gai","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[]},{"given":"Jianliang","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"key":"280_CR1","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/jctb.1997.1780","volume":"71","author":"OV Borodin","year":"1997","unstructured":"Borodin OV, Kostochka AV, Woodall DR (1997) List edge and list total colourings of multigraphs. J Comb Theory Ser B 71:184\u2013204","journal-title":"J Comb Theory Ser B"},{"key":"280_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/B:JOGO.0000006750.85332.0f","volume":"28","author":"HW Du","year":"2004","unstructured":"Du HW, Jia XH, Li DY, Wu WL (2004) Coloring of double disk graphs. J Glob Optim 28:115\u2013119","journal-title":"J Glob Optim"},{"key":"280_CR3","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1002\/jgt.3190160510","volume":"16","author":"R H\u00e4gkvist","year":"1992","unstructured":"H\u00e4gkvist R, Chetwynd A (1992) Some upper bounds on the total and list chromatic numbers of multigraphs. J Graph Theory 16:503\u2013516","journal-title":"J Graph Theory"},{"key":"280_CR4","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.tcs.2006.08.043","volume":"369","author":"JF Hou","year":"2006","unstructured":"Hou JF, Liu GZ, Cai JS (2006) List edge and list total colorings of planar graphs without 4-cycles. Theor Comput Sci 369:250\u2013255","journal-title":"Theor Comput Sci"},{"key":"280_CR5","volume-title":"Graph coloring problems","author":"T Jensen","year":"1995","unstructured":"Jensen T, Toft B (1995) Graph coloring problems. Wiley, New York"},{"key":"280_CR6","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.1016\/j.disc.2011.06.031","volume":"311","author":"R Li","year":"2011","unstructured":"Li R, Xu BG (2011) Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles. Discrete Math 311:2158\u20132163","journal-title":"Discrete Math"},{"key":"280_CR7","doi-asserted-by":"publisher","first-page":"6035","DOI":"10.1016\/j.disc.2009.05.006","volume":"309","author":"B Liu","year":"2009","unstructured":"Liu B, Hou JF, Wu JL, Liu GZ (2009) Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discrete Math 309:6035\u20136043","journal-title":"Discrete Math"},{"key":"280_CR8","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1007\/s10878-014-9805-2","volume":"31","author":"HJ Wang","year":"2016","unstructured":"Wang HJ, Wu LD, Zhang X, Wu WL, Liu B (2016) A note on the minimum number of choosability of planar graphs. J Comb Optim 31:1013\u20131022","journal-title":"J Comb Optim"},{"key":"280_CR9","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s10898-013-0138-y","volume":"60","author":"HJ Wang","year":"2014","unstructured":"Wang HJ, Wu LD, Wu WL, Pardalos PM, Wu JL (2014) Minimum total coloring of planar graph. J Glob Optim 60:777\u2013791","journal-title":"J Glob Optim"},{"doi-asserted-by":"publisher","unstructured":"Wang W, Liu X (2005) List coloring based channel allocation for open-spectrum wireless networks. In: 2005 IEEE 62nd vehicular technology conference (VTC 2005-Fall) 1, pp 690\u2013694. \n                    https:\/\/doi.org\/10.1109\/VETECF.2005.1558001","key":"280_CR10","DOI":"10.1109\/VETECF.2005.1558001"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0280-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0280-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0280-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T20:15:47Z","timestamp":1553285747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0280-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,23]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["280"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0280-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,3,23]]},"assertion":[{"value":"23 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}