{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:09Z","timestamp":1740122409604,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00880-z","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T03:31:32Z","timestamp":1658201492000},"page":"1161-1198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Sharp upper bound of injective coloring of planar graphs with girth at least 5"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4751-3765","authenticated-orcid":false,"given":"Qiming","family":"Fang","sequence":"first","affiliation":[]},{"given":"Li","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"880_CR1","doi-asserted-by":"crossref","unstructured":"Bondy J, Murty U (2007) Graph Theory. Springer Press(GTM244)","DOI":"10.1007\/978-3-7643-7400-6"},{"issue":"23\u201324","key":"880_CR2","doi-asserted-by":"publisher","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$$)-coloring of planar graphs with girth six and $$\\Delta \\ge 18$$. Discrete Mathematics 309(23\u201324):6496\u20136502","journal-title":"Discrete Mathematics"},{"issue":"1","key":"880_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1134\/S0037446606010034","volume":"52","author":"OV Borodin","year":"2011","unstructured":"Borodin OV, Ivanova AO (2011) Injective ($$\\Delta +1$$)-coloring of planar graphs with girth 6[J]. Siberian Mathematical Journal 52(1):23\u201329","journal-title":"Siberian Mathematical Journal"},{"key":"880_CR4","first-page":"2002","volume":"5","author":"OV Borodin","year":"2002","unstructured":"Borodin OV, Broersma HJ, Glebov A et al (2002) Stars and bunches in planar graphs. Part II: General planar graphs and colourings[J]. CDAM Reserach Report 5:2002","journal-title":"CDAM Reserach Report"},{"key":"880_CR5","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.jctb.2018.06.005","volume":"134","author":"M Bonamy","year":"2019","unstructured":"Bonamy M, Cranston DW, Postle L (2019) Planar graphs of girth at least five are square ($$\\Delta +2$$)-choosable. Journal of Combinatorial Theory, Series B 134:218\u2013238","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"880_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.disc.2013.10.022","volume":"317","author":"M Bonamy","year":"2014","unstructured":"Bonamy M, L\u00e9v\u00eaque B, Pinlou A (2014) Graphs with maximum degree $$\\Delta \\ge 17$$ and maximum average degree less than 3 are list 2-distance ($$\\Delta +2$$)-colorable[J]. Discrete Mathematics 317:19\u201332","journal-title":"Discrete Mathematics"},{"issue":"4","key":"880_CR7","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]. Journal of combinatorial optimization 24(4):580\u2013592","journal-title":"Journal of combinatorial optimization"},{"issue":"01","key":"880_CR8","doi-asserted-by":"publisher","first-page":"1450006","DOI":"10.1142\/S1793830914500062","volume":"6","author":"Y Bu","year":"2014","unstructured":"Bu Y, Yang S (2014) List injective coloring of planar graphs with girth $$g\\ge 5$$[J]. Discrete Mathematics, Algorithms and Applications 6(01):1450006","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"issue":"12","key":"880_CR9","doi-asserted-by":"publisher","first-page":"3043","DOI":"10.1016\/j.disc.2016.06.017","volume":"339","author":"HY Chen","year":"2016","unstructured":"Chen HY, Wu JL (2016) List injective coloring of planar graphs with girth $$g\\ge 6$$[J]. Discrete Mathematics 339(12):3043\u20133051","journal-title":"Discrete Mathematics"},{"issue":"1","key":"880_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/jgt.20273","volume":"57","author":"DW Cranston","year":"2008","unstructured":"Cranston DW, Kim SJ (2008) List-coloring the square of a subcubic graph[J]. Journal of Graph theory 57(1):65\u201387","journal-title":"Journal of Graph theory"},{"issue":"12","key":"880_CR11","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1016\/j.disc.2013.02.014","volume":"313","author":"W Dong","year":"2013","unstructured":"Dong W, Lin W (2013) Injective coloring of planar graphs with girth 6[J]. Discrete Mathematics 313(12):1302\u20131311","journal-title":"Discrete Mathematics"},{"issue":"2","key":"880_CR12","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]. Journal of Combinatorial Optimization 32(2):645\u2013655","journal-title":"Journal of Combinatorial Optimization"},{"issue":"4","key":"880_CR13","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1007\/s10878-017-0148-7","volume":"34","author":"W Dong","year":"2017","unstructured":"Dong W, Xu BG (2017) 2-Distance coloring of planar graphs with girth 5. Journal of Combinatorial Optimization 34(4):1302\u20131322","journal-title":"Journal of Combinatorial Optimization"},{"key":"880_CR14","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k Z., Nejedl$$\\check{{\\rm y}}$$ P, \u015akrekovski R (2008) Coloring squares of planar graphs with girth six[J]. European Journal of Combinatorics, 29(4): 838-849","DOI":"10.1016\/j.ejc.2007.11.005"},{"issue":"1-2","key":"880_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G Hahn","year":"2002","unstructured":"Hahn G et al (2002) On the injective chromatic number of graphs. Discrete Mathematics 256(1\u20132):179\u2013192","journal-title":"Discrete Mathematics"},{"key":"880_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.endm.2007.07.079","volume":"29","author":"F Havet","year":"2007","unstructured":"Havet F, Van den Heuvel J, McDiarmid C et al (2007) List colouring squares of planar graphs[J]. Electronic Notes in Discrete Mathematics 29:515\u2013519","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"2","key":"880_CR17","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]. Journal of Graph Theory 42(2):110\u2013124","journal-title":"Journal of Graph Theory"},{"issue":"18","key":"880_CR18","doi-asserted-by":"publisher","first-page":"5636","DOI":"10.1016\/j.disc.2008.04.005","volume":"309","author":"B Lu\u017aar","year":"2009","unstructured":"Lu\u017aar B, \u015akrekovski R, Tancer M (2009) Injective colorings of planar graphs with few colors[J]. Discrete Mathematics 309(18):5636\u20135649","journal-title":"Discrete Mathematics"},{"issue":"2","key":"880_CR19","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]. Journal of Combinatorial Theory, Series B 94(2):189\u2013213","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"880_CR20","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/S0895480101390448","volume":"17","author":"WF Wang","year":"2003","unstructured":"Wang WF, Lih KW (2003) Labeling planar graphs with conditions on girth and distance two[J]. SIAM Journal on Discrete Mathematics 17(2):264\u2013275","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"880_CR21","unstructured":"Wegner G (1977) Graphs with given diameter and a coloring problem[J]. Technical Report, University of Dortmund"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00880-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00880-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00880-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:17:07Z","timestamp":1660371427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00880-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["880"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00880-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"20 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","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 authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}