{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T17:12:38Z","timestamp":1772471558865,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371360"],"award-info":[{"award-number":["12371360"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LZ23A010004"],"award-info":[{"award-number":["LZ23A010004"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LR25A010002"],"award-info":[{"award-number":["LR25A010002"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.dam.2025.12.063","type":"journal-article","created":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:18:09Z","timestamp":1767979089000},"page":"256-267","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On 2-distance (\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e56\" altimg=\"si10.svg\">\n                      <mml:mrow>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mi>\u0394<\/mml:mi>\n                        <mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">+<\/mml:mo>\n                        <mml:mn>6<\/mml:mn>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    )-coloring of planar graphs"],"prefix":"10.1016","volume":"384","author":[{"given":"Jiahao","family":"Yu","sequence":"first","affiliation":[]},{"given":"Min","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2025.12.063_b1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1137\/S0895480100367950","article-title":"Coloring powers of planar graphs","volume":"16","author":"Agnarsson","year":"2003","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2025.12.063_b2","first-page":"2002","article-title":"Star and bunches in planar graphs. part ii: general planar graphs and colouring","volume":"5","author":"Borodin","year":"2002","journal-title":"CDAM Res. Rep."},{"key":"10.1016\/j.dam.2025.12.063_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.113288","article-title":"Improved square coloring of planar graphs","volume":"346","author":"Bousquet","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.12.063_b4","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/22M1492623","article-title":"Square coloring planar graphs with automatic discharging","volume":"38","author":"Bousquet","year":"2024","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2025.12.063_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114379","article-title":"On 2-distance 16-coloring of planar graphs with maximum degree at most five","volume":"348","author":"Deniz","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.12.063_b6","series-title":"Graph Coloring Analogues with a Condition at Distance Two: l(2,1)-Labellings and List \u039b-Labellings","author":"Jonas","year":"1993"},{"key":"10.1016\/j.dam.2025.12.063_b7","doi-asserted-by":"crossref","first-page":"817","DOI":"10.7151\/dmgt.2472","article-title":"Coloring squares of planar graphs with small maximum degree","volume":"44","author":"Krzyzi\u0144ski","year":"2024","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2025.12.063_b8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.7151\/dmgt.1176","article-title":"On the structural result on normal plane maps","volume":"22","author":"Madaras","year":"2002","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2025.12.063_b9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","article-title":"A bound on the chromatic number of square of a planar","volume":"94","author":"Molloy","year":"2005","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.12.063_b10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.dam.2017.12.041","article-title":"Upper bounds of r-hued colorings of planar graphs","volume":"243","author":"Song","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.12.063_b11","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.jctb.2017.08.010","article-title":"The square of a planar cubic graph is 7-colorable","volume":"128","author":"Thomassen","year":"2018","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.12.063_b12","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.10077","article-title":"Coloring of the square of a planar graph","volume":"42","author":"van de Heuvel","year":"2003","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2025.12.063_b13","series-title":"Graphs with Given Diameter and a Coloring Problem","author":"Wegner","year":"1977"},{"key":"10.1016\/j.dam.2025.12.063_b14","article-title":"2-Distance choosability of planar graphs with a restriction for maximum degree","volume":"448","author":"Yu","year":"2023","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2025.12.063_b15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10878-018-0285-7","article-title":"Minimum 2-distance coloring of planar graphs and channel aassignment","volume":"36","author":"Zhu","year":"2018","journal-title":"J. Comb. Optimz."},{"key":"10.1016\/j.dam.2025.12.063_b16","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.dam.2024.04.001","article-title":"Square coloring of planar graphs with maximum degree at most five","volume":"353","author":"Zou","year":"2024","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26000107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26000107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T16:44:00Z","timestamp":1772469840000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26000107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":16,"alternative-id":["S0166218X26000107"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2025.12.063","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On 2-distance ()-coloring of planar graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2025.12.063","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}