{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:52:45Z","timestamp":1778597565523,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004410","name":"TUBITAK","doi-asserted-by":"crossref","award":["122F250"],"award-info":[{"award-number":["122F250"]}],"id":[{"id":"10.13039\/501100004410","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":[[2024,5]]},"DOI":"10.1007\/s10878-024-01169-z","type":"journal-article","created":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T09:01:30Z","timestamp":1714899690000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Some results on 2-distance coloring of planar graphs with girth five"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0701-0397","authenticated-orcid":false,"given":"Zakir","family":"Deniz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,5]]},"reference":[{"issue":"01","key":"1169_CR1","doi-asserted-by":"publisher","first-page":"1650013","DOI":"10.1142\/S1793830916500130","volume":"8","author":"B Yuehua","year":"2016","unstructured":"Yuehua B, Shang C (2016) List 2-distance coloring of planar graphs without short cycles. Discrete Math Algorithms Appl 8(01):1650013","journal-title":"Discrete Math Algorithms Appl"},{"issue":"4","key":"1169_CR2","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s10878-011-9409-z","volume":"24","author":"Y Bu","year":"2012","unstructured":"Bu Y, Zhu X (2012) An optimal square coloring of planar graphs. J Comb Optim 24(4):580\u2013592","journal-title":"J Comb Optim"},{"key":"1169_CR3","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10878-015-9888-4","volume":"32","author":"W Dong","year":"2016","unstructured":"Dong W, Lin W (2016) An improved bound on 2-distance coloring plane graphs with girth 5. J Comb Optim 32:645\u2013655","journal-title":"J Comb Optim"},{"key":"1169_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.dam.2016.07.026","volume":"217","author":"W Dong","year":"2017","unstructured":"Dong W, Lin W (2017) On 2-distance coloring of plane graphs with girth 5. Discret Appl Math 217:495\u2013505","journal-title":"Discret Appl Math"},{"key":"1169_CR5","unstructured":"Hartke Stephen G, Jahanbekam S, Thomas B (2016) The chromatic number of the square of subcubic planar graphs. arXiv preprint arXiv:1604.06504"},{"issue":"6","key":"1169_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00373-022-02572-1","volume":"38","author":"H La","year":"2022","unstructured":"La H (2022) 2-distance list ($$\\delta $$+ 3)-coloring of sparse graphs. Graphs Comb 38(6):167","journal-title":"Graphs Comb"},{"issue":"2","key":"1169_CR7","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1007\/s10878-022-00883-w","volume":"44","author":"H La","year":"2022","unstructured":"La H, Montassier M (2022) 2-distance list ($$\\delta $$+ 2)-coloring of planar graphs with girth at least 10. J Comb Optim 44(2):1356\u20131375","journal-title":"J Comb Optim"},{"key":"1169_CR8","doi-asserted-by":"publisher","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 Ser B 94:189\u2013213","journal-title":"J Comb Theory Ser B"},{"key":"1169_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jctb.2017.08.010","volume":"128","author":"C Thomassen","year":"2018","unstructured":"Thomassen C (2018) The square of a planar cubic graph is 7-colorable. J Comb Theory Ser B 128:192\u2013218","journal-title":"J Comb Theory Ser B"},{"issue":"2","key":"1169_CR10","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J van den Heuvel","year":"2003","unstructured":"van den Heuvel J, McGuinness S (2003) Coloring the square of a planar graph. J Graph Theory 42(2):110\u2013124","journal-title":"J Graph Theory"},{"key":"1169_CR11","unstructured":"Wegner G (1977) Graphs with given diameter and a coloring problem. Technical report, University of Dormund"},{"key":"1169_CR12","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, vol 2. Prentice hall, Upper Saddle River"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01169-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01169-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01169-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T13:12:05Z","timestamp":1715951525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01169-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1169"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01169-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"12 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"68"}}