{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:19:03Z","timestamp":1649107143249},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T00:00:00Z","timestamp":1388707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10878-013-9700-2","type":"journal-article","created":{"date-parts":[[2014,1,2]],"date-time":"2014-01-02T09:24:51Z","timestamp":1388654691000},"page":"1180-1195","source":"Crossref","is-referenced-by-count":3,"title":["List 2-distance coloring of planar graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,3]]},"reference":[{"key":"9700_CR1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1137\/S0895480100367950","volume":"16","author":"G Agnarsson","year":"2000","unstructured":"Agnarsson G, Halldorsson MM (2000) Coloring powers of planar graphs. SIAM J Discret Math 16:651\u2013662","journal-title":"SIAM J Discret Math"},{"issue":"4","key":"9700_CR2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1137\/S0895480100367950","volume":"16","author":"G Agnarsson","year":"2003","unstructured":"Agnarsson G, Halldorsson MM (2003) Coloring powers of planar graphs [J]. SIAM J Discret Math 16(4):651\u2013662","journal-title":"SIAM J Discret Math"},{"issue":"4","key":"9700_CR3","first-page":"9","volume":"8","author":"OV Borodin","year":"2001","unstructured":"Borodin OV, Broersma HJ, Glebov AN, van den Heuvel J (2001) The minimum degree and chromatic number of the square of a planar graph [J]. Diskret Anal Issled Oper 8(4):9\u201333","journal-title":"Diskret Anal Issled Oper"},{"issue":"2","key":"9700_CR4","first-page":"3","volume":"13","author":"OV Borodin","year":"2006","unstructured":"Borodin OV, Ivanova AO, Neustroeva TK (2006) (p, q)-coloring of sparse planar graphs [J]. Mat Zametki YaGU 13(2):3\u20139","journal-title":"Mat Zametki YaGU"},{"key":"9700_CR5","first-page":"355","volume":"3","author":"OV Borodin","year":"2006","unstructured":"Borodin OV, Ivanova AO, Neustroeva TK (2006) List (p, q)-coloring of sparse planar graphs [J]. Sibirsk Elektron Mat Izv 3:355\u2013361","journal-title":"Sibirsk Elektron Mat Izv"},{"issue":"2","key":"9700_CR6","first-page":"15","volume":"8","author":"OV Borodin","year":"2001","unstructured":"Borodin OV, Broersma HJ, Glebov AN, van den Heuvel J (2001) The structure of plane triangulations in terms of stars and bunches [J]. Diskret Anal Issled Oper 8(2):15\u201339","journal-title":"Diskret Anal Issled Oper"},{"key":"9700_CR7","doi-asserted-by":"crossref","first-page":"6496","DOI":"10.1016\/j.disc.2009.06.029","volume":"309","author":"OV Borodin","year":"2009","unstructured":"Borodin OV, Ivanova AO (2009) 2-Distance ( $$\\Delta +2$$ \u0394 + 2 )-coloring of planar graphs with girth six and $$\\Delta \\ge 18$$ \u0394 \u2265 18 [J]. Discret Math 309:6496\u20136502","journal-title":"Discret Math"},{"issue":"3","key":"9700_CR8","first-page":"32","volume":"12","author":"OV Borodin","year":"2005","unstructured":"Borodin OV, Ivanova AO, Neustroeva TK (2005) List 2-distance( $$\\Delta +1$$ \u0394 + 1 )-coloring of planar graphs with given girth. Diskret Anal Issled Oper 12(3):32\u201347","journal-title":"Diskret Anal Issled Oper"},{"key":"9700_CR9","first-page":"427","volume":"313","author":"Marthe Bonamy","year":"2013","unstructured":"Bonamy Marthe (2013) Graphs with maximum degree $$\\Delta \\ge 17$$ \u0394 \u2265 17 and maximum average degree less than 3 are list 2-distance ( $$\\Delta +2$$ \u0394 + 2 )-colorable [J]. Discret Math 313:427\u2013449","journal-title":"Discret Math"},{"issue":"6","key":"9700_CR10","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1007\/s11202-009-0106-4","volume":"50","author":"OV Borodin","year":"2009","unstructured":"Borodin OV, Ivanova AO (2009) List 2-distance ( $$\\Delta +2$$ \u0394 + 2 )-coloring of planar graphs with girth six and $$\\Delta \\ge 24$$ \u0394 \u2265 24 . Sib Math J 50(6):958\u2013964","journal-title":"Sib Math J"},{"key":"9700_CR11","unstructured":"Cranston DW, Erman R, Skrekovski R (2013) Choosability of the square of a planar graph with maximum degree four, manuscript"},{"key":"9700_CR12","first-page":"976","volume":"43","author":"Z Dvorak","year":"2005","unstructured":"Dvorak Z, Kral D, Nejedly P et al (2005) Coloring squares of planar graphs with no short cycles [J]. Discret Appl Math 43:976\u20131008","journal-title":"Discret Appl Math"},{"key":"9700_CR13","first-page":"736","volume-title":"Frequency channel assignment on planar networks [J], algorithms-ESA 2002","author":"M Molloy","year":"2012","unstructured":"Molloy M, Salavatipour MR (2012) Frequency channel assignment on planar networks [J], algorithms-ESA 2002. Springer, Berlin, pp 736\u2013747"},{"issue":"2","key":"9700_CR14","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/S0895480101390448","volume":"17","author":"FW Wang","year":"2003","unstructured":"Wang FW, Lih W (2003) Labeling planar graphs with conditions on girth and distance two. SIAM J Discret Math 17(2):264\u2013275","journal-title":"SIAM J Discret Math"},{"key":"9700_CR15","volume-title":"Graphs with given diameter and a coloring problem [R]","author":"G Wegner","year":"1977","unstructured":"Wegner G (1977) Graphs with given diameter and a coloring problem [R]. University of Dortmund, Berlin"},{"key":"9700_CR16","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/s10878-011-9409-z","volume":"24","author":"Bu YueHua","year":"2012","unstructured":"YueHua Bu, Zhu Xubo (2012) An optimal square coloring of planar graphs. J Comb Optim 24:580\u2013592","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9700-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9700-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9700-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T18:02:01Z","timestamp":1565028121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9700-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,3]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9700"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9700-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,3]]}}}