{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:21:43Z","timestamp":1648531303245},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,17]],"date-time":"2014-10-17T00:00:00Z","timestamp":1413504000000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10878-014-9805-2","type":"journal-article","created":{"date-parts":[[2014,10,16]],"date-time":"2014-10-16T09:59:56Z","timestamp":1413453596000},"page":"1013-1022","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A note on the minimum number of choosability of planar graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Huijuan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,17]]},"reference":[{"key":"9805_CR1","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/s10878-011-9385-3","volume":"24","author":"P Angelini","year":"2012","unstructured":"Angelini P, Frati F (2012) Acyclically 3-colorable planar graphs. J Comb Optim 24:116\u2013130","journal-title":"J Comb Optim"},{"key":"9805_CR2","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10878-011-9448-5","volume":"25","author":"S Bessy","year":"2013","unstructured":"Bessy S, Havet F (2013) Enumerating the edge-colourings and total colourings of a regular graph. J Comb Optim 25:523\u2013535","journal-title":"J Comb Optim"},{"key":"9805_CR3","doi-asserted-by":"crossref","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 Combin Theory Ser B 71:184\u2013204","journal-title":"J Combin Theory Ser B"},{"key":"9805_CR4","doi-asserted-by":"crossref","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 Global Optim 28:115\u2013119","journal-title":"J Global Optim"},{"key":"9805_CR5","doi-asserted-by":"crossref","unstructured":"Garg N, Papatriantafilou M, Tsigas P (1996) Distributed list coloring: how to dynamically allocate frequencies to mobile base stations. In: Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, pp 18\u201325. doi: 10.1109\/SPDP.1996.570312","DOI":"10.1109\/SPDP.1996.570312"},{"key":"9805_CR6","doi-asserted-by":"crossref","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":"9805_CR7","doi-asserted-by":"crossref","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. Theoret Comput Sci 369:250\u2013255","journal-title":"Theoret Comput Sci"},{"key":"9805_CR8","volume-title":"Graph coloring problems","author":"T Jensen","year":"1995","unstructured":"Jensen T, Toft B (1995) Graph coloring problems. Wiley-Interscience, NewYork"},{"key":"9805_CR9","doi-asserted-by":"crossref","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":"9805_CR10","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1007\/s10878-012-9525-4","volume":"25","author":"XW Li","year":"2013","unstructured":"Li XW, Mak-Hau V, Zhou SM (2013) The $$L(2,1)$$ L ( 2 , 1 ) -labelling problem for cubic Cayley graphs on dihedral groups. J Comb Optim 25:716\u2013736","journal-title":"J Comb Optim"},{"key":"9805_CR11","doi-asserted-by":"crossref","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":"9805_CR12","first-page":"3","volume":"29","author":"VG Vizing","year":"1976","unstructured":"Vizing VG (1976) Vertex colorings with given colors. Metody Diskret Analiz (in Russian) 29:3\u201310","journal-title":"Metody Diskret Analiz (in Russian)"},{"key":"9805_CR13","doi-asserted-by":"crossref","unstructured":"Wang HJ, Wu LD, Wu WL, Pardalos PM, Wu JL (2014a) Minimum total coloring of planar graph. J Glob Optim. doi: 10.1007\/s10898-013-0138-y","DOI":"10.1007\/s10898-013-0138-y"},{"key":"9805_CR14","doi-asserted-by":"crossref","unstructured":"Wang HJ, Wu LD, Wu WL, Wu JL (2014b) Minimum number of disjoint linear forests covering a planar graph. J Comb Optim 28:274\u2013287","DOI":"10.1007\/s10878-013-9680-2"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9805-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9805-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9805-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:24Z","timestamp":1559276604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9805-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,17]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9805"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9805-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,17]]}}}