{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:57:33Z","timestamp":1648731453266},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T00:00:00Z","timestamp":1428019200000},"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-9873-y","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T15:23:42Z","timestamp":1428074622000},"page":"244-259","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["2-Distance coloring of a planar graph without 3, 4, 7-cycles"],"prefix":"10.1007","volume":"32","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xia","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,3]]},"reference":[{"key":"9873_CR1","unstructured":"Bonamy M, L\u00e9v\u00eaque B, Pinlou A (2014) 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. Discret Math 317"},{"key":"9873_CR2","unstructured":"Borodin OV, Broersma HJ, Glebov A et al (2002) Stars and bunches in planar graphs. Part II: General planar graphs and colourings, CDAM Researches Report"},{"key":"9873_CR3","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 . Discret Math 309:6496\u20136502","journal-title":"Discret Math"},{"issue":"6","key":"9873_CR4","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1360\/012011-695","volume":"42","author":"Y Bu","year":"2012","unstructured":"Bu Y, Zhu X (2012) 2-Distance coloring of planar graphs without short cycles. Sci Sin Math 42(6):635\u2013664","journal-title":"Sci Sin Math"},{"key":"9873_CR5","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1016\/j.ejc.2007.11.005","volume":"29","author":"Z Dvo\u0159\u00e0k","year":"2008","unstructured":"Dvo\u0159\u00e0k Z, Kr\u00e1l D, Nejedl\u00fd P et al (2008) Coloring squares of planar graphs with girth six. Eur J Comb 29:838\u2013849","journal-title":"Eur J Comb"},{"key":"9873_CR6","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J Heuvel","year":"2003","unstructured":"Heuvel J, McGuiness S (2003) Coloring of the square of a planar graph. J Graph Theory 42:110\u2013124","journal-title":"J Graph Theory"},{"key":"9873_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","volume":"94","author":"M Molloy","year":"2005","unstructured":"Molloy M, Salavatipour MR (2005) A bound on the chromatic number of the square of a planar graph. J Comb Theory B 94:189\u2013213","journal-title":"J Comb Theory B"},{"key":"9873_CR8","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/S0895480101390448","volume":"17","author":"W Wang","year":"2003","unstructured":"Wang W, Lih K-W (2003) Labeling planar graphs with condition on girth and distance two. SIAM J Discret Math 17:264\u2013275","journal-title":"SIAM J Discret Math"},{"key":"9873_CR9","unstructured":"Wegner G (1977) Graphs with given diameter and a coloring problem. Technical Report, University of Dortmund, Germany"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9873-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9873-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9873-y","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-9873-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9873"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9873-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,3]]}}}