{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T14:47:55Z","timestamp":1749653275366,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T00:00:00Z","timestamp":1687219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T00:00:00Z","timestamp":1687219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10878-023-01053-2","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T09:02:20Z","timestamp":1687251740000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["2-Distance coloring of planar graphs without adjacent 5-cycles"],"prefix":"10.1007","volume":"45","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zewei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2876-7153","authenticated-orcid":false,"given":"Hongguo","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"key":"1053_CR1","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. Discret Math. 317:19\u201332","journal-title":"Discret Math."},{"key":"1053_CR2","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. J Comb Theory Ser B 134:218\u2013238","journal-title":"J Comb Theory Ser B"},{"key":"1053_CR3","unstructured":"Borodin OV, Broersma HJ, Glebov A, van den Heuvel J (2002) Stars and bunches in planar graphs. PartII: general planar graphs and colourings, CDAM Research Report 2002\u201305"},{"key":"1053_CR4","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. J Comb Optim 34:1302\u20131322","journal-title":"J Comb Optim"},{"key":"1053_CR5","doi-asserted-by":"publisher","unstructured":"Hartke SG, Jahanbekam S, Thomas B (2021) The chromatic number of the square of subcubic planar graphs. https:\/\/doi.org\/10.48550\/arXiv.1604.06504","DOI":"10.48550\/arXiv.1604.06504"},{"key":"1053_CR6","doi-asserted-by":"publisher","unstructured":"Havet F, van den Heuvel J, McDiarmid C, Reed B (2018) List colouring squares of planar graphs. https:\/\/doi.org\/10.48550\/arXiv.0807.3233","DOI":"10.48550\/arXiv.0807.3233"},{"key":"1053_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1134\/S1990478911020098","volume":"5","author":"AO Ivanova","year":"2011","unstructured":"Ivanova AO (2011) List 2-distance $$(\\Delta +1)$$-coloring of planar graphs with girth at least 7. J Appl Ind Math 5:221\u2013230","journal-title":"J Appl Ind Math"},{"key":"1053_CR8","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/s10255-022-1097-1","volume":"38","author":"YD Jin","year":"2022","unstructured":"Jin YD, Miao LY (2022) List 2-distance coloring of planar graphs with girth five. Acta Math Appl Sin Engl Ser 38:540\u2013548","journal-title":"Acta Math Appl Sin Engl Ser"},{"key":"1053_CR9","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":"1053_CR10","doi-asserted-by":"crossref","unstructured":"Thomassen C (2018) The square of a planar cubic graph is 7-colorable. J Comb Theory Ser B 128192\u2013218","DOI":"10.1016\/j.jctb.2017.08.010"},{"key":"1053_CR11","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 of the square of planar graph. J Graph theory 42:110\u2013124","journal-title":"J Graph theory"},{"key":"1053_CR12","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 wiht conditions on girth and distance two. SIAM J Discret Math 17:264\u2013275","journal-title":"SIAM J Discret Math"},{"key":"1053_CR13","volume-title":"Graphs with given diameter and a coloring problem. Technical report","author":"G Wegner","year":"1977","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":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01053-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01053-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01053-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T04:08:53Z","timestamp":1689998933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01053-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,20]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1053"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01053-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,6,20]]},"assertion":[{"value":"26 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2023","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 not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"126"}}