{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T18:45:58Z","timestamp":1780339558349,"version":"3.54.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,2]],"date-time":"2015-04-02T00:00:00Z","timestamp":1427932800000},"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,7]]},"DOI":"10.1007\/s10878-015-9870-1","type":"journal-article","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T18:27:27Z","timestamp":1427912847000},"page":"188-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["List edge and list total coloring of planar graphs with maximum degree 8"],"prefix":"10.1007","volume":"32","author":[{"given":"Huijuan","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongwei","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,4,2]]},"reference":[{"key":"9870_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":"9870_CR2","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 Comb Theory Ser B 71:184\u2013204","journal-title":"J Comb Theory Ser B"},{"key":"9870_CR3","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":"9870_CR4","doi-asserted-by":"publisher","unstructured":"Garg N, Papatriantafilou M, Tsigas P (1996) Distributed list coloring: how to dynamically allocate frequencies to mobile base stations. In: Eighth IEEE symposium on parallel and distributed processing, pp 18\u201325. doi: 10.1109\/SPDP.1996.570312","DOI":"10.1109\/SPDP.1996.570312"},{"key":"9870_CR5","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":"9870_CR6","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. Theor Comput Sci 369:250\u2013255","journal-title":"Theor Comput Sci"},{"key":"9870_CR7","volume-title":"Graph coloring problems","author":"T Jensen","year":"1995","unstructured":"Jensen T, Toft B (1995) Graph coloring problems. Wiley-Interscience, New York"},{"key":"9870_CR8","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":"9870_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. Discret Math 311:2158\u20132163","journal-title":"Discret Math"},{"key":"9870_CR10","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. Discret Math 309:6035\u20136043","journal-title":"Discret Math"},{"key":"9870_CR11","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/s10878-013-9680-2","volume":"28","author":"HJ Wang","year":"2014","unstructured":"Wang HJ, Wu LD, Wu WL, Wu JL (2014) Minimum number of disjoint linear forests covering a planar graph. J Comb Optim 28:274\u2013287","journal-title":"J Comb Optim"},{"key":"9870_CR12","doi-asserted-by":"publisher","unstructured":"Wang HJ, Wu LD, Zhang X, Wu WL, Liu B (2014) A note on the minimum number of choosability of planar graphs. J Comb Optim doi: 10.1007\/s10878-014-9805-2","DOI":"10.1007\/s10878-014-9805-2"},{"key":"9870_CR13","doi-asserted-by":"crossref","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 Global Optim 60:777\u2013791","journal-title":"J Global Optim"},{"key":"9870_CR14","doi-asserted-by":"publisher","unstructured":"Wang W, Liu X (2005) List coloring based channel allocation for open-spectrum wireless networks. In: IEEE 62nd vehicular technology conference (VTC 2005-Fall) (1):690\u2013694, doi: 10.1109\/VETECF.2005.1558001","DOI":"10.1109\/VETECF.2005.1558001"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9870-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9870-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9870-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:26Z","timestamp":1559276606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9870-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9870"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9870-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,2]]}}}