{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:23Z","timestamp":1740122363858,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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,1]]},"DOI":"10.1007\/s10878-022-00985-5","type":"journal-article","created":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T09:06:47Z","timestamp":1673082407000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The r-dynamic chromatic number of planar graphs without 4-,5-cycles"],"prefix":"10.1007","volume":"45","author":[{"given":"Ruiying","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuehua","family":"Bu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junlei","family":"Zhu","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,1,7]]},"reference":[{"key":"985_CR1","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1016\/j.ejc.2008.12.019","volume":"30","author":"OV Borodin","year":"2009","unstructured":"Borodin OV, Ivanova AO (2009) List 2-distance ($$\\Delta + 2$$)-coloring of planar graphs with girth six. Eur J Comb 30:1257\u20131262","journal-title":"Eur J Comb"},{"key":"985_CR2","first-page":"2150007","volume":"13","author":"Y Bu","year":"2021","unstructured":"Bu Y, Cao J (2021) 2-Distance coloring of planar graph. Discrete Appl Math 13:2150007","journal-title":"Discrete Appl Math"},{"key":"985_CR3","doi-asserted-by":"crossref","unstructured":"Bu Y, Yang R, Zhu H (2022) The r-dynamic chromatic number of planar graphs without special short cycles. In: AAIM 2022, LNCS 13513","DOI":"10.1007\/978-3-031-16081-3_27"},{"key":"985_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2020.103219","volume":"91","author":"H La","year":"2021","unstructured":"La H, Montassier M, Pinlou A et al (2021) r-Hued (r+1)-coloring of planar graphs with girth at least 8 for r$$\\ge 9$$. Eur J Comb 91:103219","journal-title":"Eur J Comb"},{"key":"985_CR5","doi-asserted-by":"publisher","DOI":"10.33915\/etd.1397","volume-title":"Dynamic coloring of graphs","author":"B Montgomery","year":"2001","unstructured":"Montgomery B (2001) Dynamic coloring of graphs. West Virginia University, Morgantwon"},{"key":"985_CR6","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.dam.2017.12.041","volume":"243","author":"H Song","year":"2018","unstructured":"Song H, Lai H (2018) Upper bounds of r-hued colorings of planar graphs. Discrete Appl Math 243:262\u2013269","journal-title":"Discrete Appl Math"},{"key":"985_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.dam.2015.05.015","volume":"198","author":"H Song","year":"2016","unstructured":"Song H, Lai H, Wu J (2016) On r-hued coloring of planar graphs with girth at least 6. Discrete Appl Math 198:251\u2013263","journal-title":"Discrete Appl Math"},{"key":"985_CR8","volume-title":"r-Dynamic coloring of planar graphs","author":"X Wang","year":"2020","unstructured":"Wang X (2020) r-Dynamic coloring of planar graphs. Zhejiang Noamal University, Jinhua"},{"key":"985_CR9","unstructured":"Wegner G (1977) Graphs with given diameter and a coloring problem. Technical Report, University of Dortmund"},{"key":"985_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10878-018-0285-7","volume":"36","author":"J Zhu","year":"2018","unstructured":"Zhu J, Bu Y (2018) Minimum 2-distance coloring of planar graphs and channel assignment. J Comb Optim 36:55\u201364","journal-title":"J Comb Optim"},{"key":"985_CR11","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1007\/s10878-018-0312-8","volume":"36","author":"H Zhu","year":"2018","unstructured":"Zhu H, Gu Y, Sheng J, Lv X (2018) List 2-distance ($$\\Delta + 3$$)-coloring of planar graphswithout 4,5-cycles. J Comb Optim 36:1411\u20131424","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00985-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00985-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00985-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T07:51:27Z","timestamp":1675497087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00985-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["985"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00985-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"30 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 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":"We declare that we have no conflicts of interest to this work. We also declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"47"}}