{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:52:43Z","timestamp":1778597563803,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T00:00:00Z","timestamp":1659052800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T00:00:00Z","timestamp":1659052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-17-CE40-0022"],"award-info":[{"award-number":["ANR-17-CE40-0022"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"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-00883-w","type":"journal-article","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T21:02:42Z","timestamp":1659128562000},"page":"1356-1375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["2-Distance list $$(\\Delta +2)$$-coloring of planar graphs with girth at least 10"],"prefix":"10.1007","volume":"44","author":[{"given":"Hoang","family":"La","sequence":"first","affiliation":[]},{"given":"Mickael","family":"Montassier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,29]]},"reference":[{"key":"883_CR1","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 D, Postle L (2019) Planar graphs of girth at least five are square ($$\\Delta +2$$)-choosable. J of Comb Theory, Ser B 134:218\u2013238","journal-title":"J of Comb Theory, Ser B"},{"issue":"3","key":"883_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1002\/jgt.21782","volume":"77","author":"M Bonamy","year":"2014","unstructured":"Bonamy M, L\u00e9v\u00eaque B, Pinlou A (2014) 2-distance coloring of sparse graphs. J of Graph Theory 77(3):190\u2013218","journal-title":"J of Graph Theory"},{"key":"883_CR3","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. Discrete Math 317:19\u201332","journal-title":"Discrete Math"},{"key":"883_CR4","first-page":"129","volume":"1","author":"OV Borodin","year":"2004","unstructured":"Borodin OV, Glebov AN, Ivanova AO, Neutroeva TK, Tashkinov VA (2004) Sufficient conditions for the 2-distance ($$\\Delta +1$$)-colorability of plane graphs. Sibirskie Elektronnye Matematicheskie Izvestiya 1:129\u2013141","journal-title":"Sibirskie Elektronnye Matematicheskie Izvestiya"},{"key":"883_CR5","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.disc.2011.09.018","volume":"312","author":"OV Borodin","year":"2012","unstructured":"Borodin OV, Ivanova AO (2012) List 2-facial 5-colorability of plane graphs with girth at least 12. Discrete Math 312:306\u2013314","journal-title":"Discrete Math"},{"issue":"2","key":"883_CR6","doi-asserted-by":"publisher","first-page":"1550017","DOI":"10.1142\/S1793830915500172","volume":"7","author":"Y Bu","year":"2015","unstructured":"Bu Y, Lv X, Yan X (2015) The list 2-distance coloring of a graph with $$\\Delta (G)=5$$. Discrete Math, Algorithms and Appl 7(2):1550017","journal-title":"Discrete Math, Algorithms and Appl"},{"issue":"1","key":"883_CR7","doi-asserted-by":"publisher","first-page":"1650013","DOI":"10.1142\/S1793830916500130","volume":"8","author":"Y Bu","year":"2016","unstructured":"Bu Y, Shang C (2016) List 2-distance coloring of planar graphs without short cycles. Discrete Math, Algorithms and Appl 8(1):1650013","journal-title":"Discrete Math, Algorithms and Appl"},{"key":"883_CR8","doi-asserted-by":"crossref","unstructured":"Bu Y, Zhu J (2018) Channel Assignment with r-Dynamic Coloring: 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3\u20134, 2018, Proceedings pp 36\u201348","DOI":"10.1007\/978-3-030-04618-7_4"},{"key":"883_CR9","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 of Comb Optim 24:580\u2013592","journal-title":"J of Comb Optim"},{"issue":"1","key":"883_CR10","first-page":"86","volume":"59","author":"D Cranston","year":"2014","unstructured":"Cranston D, Erman R, \u0160krekovski R (2014) Choosability of the square of a planar graph with maximum degree four. Australian J of Comb 59(1):86\u201397","journal-title":"Australian J of Comb"},{"key":"883_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/jgt.20273","volume":"1","author":"D Cranston","year":"2008","unstructured":"Cranston D, Kim S-J (2008) List-coloring the square of a subcubic graph. J of Graph Theory 1:65\u201387","journal-title":"J of Graph Theory"},{"issue":"2","key":"883_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 of Comb Optim 32(2):645\u2013655","journal-title":"J of Comb Optim"},{"key":"883_CR13","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. Discrete Appl Math 217:495\u2013505","journal-title":"Discrete Appl Math"},{"key":"883_CR14","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 B (2017) 2-distance coloring of planar graphs with girth 5. J of Comb Optim 34:1302\u20131322","journal-title":"J of Comb Optim"},{"issue":"4","key":"883_CR15","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.ejc.2007.11.005","volume":"29","author":"Z Dvo\u0159\u00e1k","year":"2008","unstructured":"Dvo\u0159\u00e1k Z, Kr\u00e0l D, Nejedl\u1ef3 P, \u0160krekovski R (2008) Coloring squares of planar graphs with girth six. European J of Comb 29(4):838\u2013849","journal-title":"European J of Comb"},{"key":"883_CR16","unstructured":"Hartke SG, Jahanbekam S, Thomas B (2018) The chromatic number of the square of subcubic planar graphs. arXiv:1604.06504"},{"key":"883_CR17","unstructured":"Havet F, Van\u00a0Den Heuvel J, McDiarmid C, Reed B (2017) List colouring squares of planar graphs. arXiv:0807.3233"},{"issue":"2","key":"883_CR18","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 of Appl and Industrial Math 5(2):221\u2013230","journal-title":"J of Appl and Industrial Math"},{"issue":"2","key":"883_CR19","first-page":"1031","volume":"14","author":"F Kramer","year":"1969","unstructured":"Kramer F, Kramer H (1969) Ein F\u00e4rbungsproblem der Knotenpunkte eines Graphen bez\u00fcglich der Distanz p. Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es 14(2):1031\u20131038","journal-title":"Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"883_CR20","first-page":"46","volume":"268","author":"F Kramer","year":"1969","unstructured":"Kramer F, Kramer H (1969) Un probl\u00e8me de coloration des sommets d\u2019un graphe. Comptes Rendus Math\u00e9matique Acad\u00e9mie des Sci, Paris 268:46\u201348","journal-title":"Comptes Rendus Math\u00e9matique Acad\u00e9mie des Sci, Paris"},{"key":"883_CR21","doi-asserted-by":"crossref","unstructured":"La H (2021) 2-distance list $$(\\Delta +3)$$-coloring of sparse graphs. arXiv:2105.01684","DOI":"10.1007\/s10878-022-00883-w"},{"key":"883_CR22","doi-asserted-by":"crossref","unstructured":"La H, Montassier M (2021a) 2-distance 4-coloring of planar subcubic graphs with girth at least 21. arXiv:2106.03587","DOI":"10.1007\/s10878-022-00883-w"},{"key":"883_CR23","doi-asserted-by":"crossref","unstructured":"La H, Montassier M (2021b) 2-distance $$(\\Delta +1)$$-coloring of sparse graphs using the potential method. arXiv:2103.11687","DOI":"10.1007\/978-3-030-83823-2_54"},{"key":"883_CR24","doi-asserted-by":"crossref","unstructured":"La H, Montassier M (2021c) 2-distance $$(\\Delta +2)$$-coloring of sparse graphs. arXiv:2109.11927","DOI":"10.1007\/s00373-022-02572-1"},{"key":"883_CR25","doi-asserted-by":"publisher","first-page":"103219","DOI":"10.1016\/j.ejc.2020.103219","volume":"91","author":"H La","year":"2021","unstructured":"La H, Montassier M, Pinlou A, Valicov P (2021) $$r$$-hued $$(r+1)$$-coloring of planar graphs with girth at least 8 for $$r\\ge 9$$. European J of Comb 91:103219","journal-title":"European J of Comb"},{"issue":"1","key":"883_CR26","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0012-365X(03)00059-1","volume":"269","author":"K-W Lih","year":"2003","unstructured":"Lih K-W, Wang W-F, Zhu X (2003) Coloring the square of a $$K_4$$-minor free graph. Discrete Math 269(1):303\u2013309","journal-title":"Discrete Math"},{"key":"883_CR27","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 of Comb Theory, Ser B 128:192\u2013218","journal-title":"J of Comb Theory, Ser B"},{"key":"883_CR28","unstructured":"Wegner G (1977) Graphs with given diameter and a coloring problem. Technical report, University of Dormund"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00883-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00883-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00883-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T00:53:56Z","timestamp":1676249636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00883-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,29]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["883"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00883-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,29]]},"assertion":[{"value":"22 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 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":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics 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"}}]}}