{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:51Z","timestamp":1759637571884,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,27]],"date-time":"2019-02-27T00:00:00Z","timestamp":1551225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LQ19A010005","LY17A010025"],"award-info":[{"award-number":["LQ19A010005","LY17A010025"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"name":"General SRT Programe of Jiaxing University","award":["in 2018"],"award-info":[{"award-number":["in 2018"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10878-019-00387-0","type":"journal-article","created":{"date-parts":[[2019,2,27]],"date-time":"2019-02-27T19:47:51Z","timestamp":1551296871000},"page":"545-555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal r-dynamic coloring of sparse graphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Dan","family":"Yi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1561-5772","authenticated-orcid":false,"given":"Junlei","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lixia","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengyini","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,27]]},"reference":[{"key":"387_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, New York"},{"key":"387_CR2","first-page":"129","volume":"1","author":"OV Borodin","year":"2004","unstructured":"Borodin OV, Glebow AN, Ivanova AO, Neustroeva TK, Taskinov VA (2004) Sufficient conditions for planar graphs to be 2-distance \n                    \n                      \n                    \n                    $$(\\Delta +1)$$\n                    \n                      \n                        \n                          (\n                          \u0394\n                          +\n                          1\n                          )\n                        \n                      \n                    \n                  -colorable. Sib Elektron Mat Izv 1:129\u2013141 (in Russian)","journal-title":"Sib Elektron Mat Izv"},{"key":"387_CR3","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s10878-011-9409-z","volume":"24","author":"YH Bu","year":"2012","unstructured":"Bu YH, Zhu XB (2012) An optimal square coloring of planar graphs. J Comb Optim 24:580\u2013592","journal-title":"J Comb Optim"},{"issue":"2","key":"387_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10878-017-0168-3","volume":"35","author":"H Cai","year":"2018","unstructured":"Cai H, Wu JL, Sun L (2018) Vertex arboricity of planar graphs without intersecting 5-cycles. J Comb Optim 35(2):365\u2013372","journal-title":"J Comb Optim"},{"issue":"1","key":"387_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-017-0149-6","volume":"35","author":"XH Cheng","year":"2018","unstructured":"Cheng XH, Wu JL (2018) The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven. J Comb Optim 35(1):1\u201313","journal-title":"J Comb Optim"},{"key":"387_CR6","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.dam.2012.01.012","volume":"160","author":"Y Chen","year":"2012","unstructured":"Chen Y, Fan SH, Lai HJ, Song HM, Sun L (2012) On dynamic coloring for planar graphs and graphs of higher genus. Discrete Appl Math 160:1064\u20131071","journal-title":"Discrete Appl Math"},{"key":"387_CR7","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2017.05.018","volume":"689","author":"XX Hu","year":"2017","unstructured":"Hu XX, Wang P, Wang YQ, Wang WF (2017) The entire chromatic number of graphs embedded on the torus with large maximum degree. Theor Comput Sci 689:108\u2013116","journal-title":"Theor Comput Sci"},{"issue":"5","key":"387_CR8","first-page":"22","volume":"17","author":"AO Ivanova","year":"2010","unstructured":"Ivanova AO (2010) List 2-distance \n                    \n                      \n                    \n                    $$(\\Delta +1)$$\n                    \n                      \n                        \n                          (\n                          \u0394\n                          +\n                          1\n                          )\n                        \n                      \n                    \n                  -coloring of planar graphs with girth at least 7 (in Russian). Diskretn Anal Issled Oper Ser 1 17(5):22\u201336 Translated in: J Appl Ind Math 5:221-230(2011)","journal-title":"Diskretn Anal Issled Oper Ser 1"},{"key":"387_CR9","doi-asserted-by":"crossref","unstructured":"Jahanbekam S, Kim J, Suil O, West DB (2016) On \n                    \n                      \n                    \n                    $$r$$\n                    \n                      \n                        r\n                      \n                    \n                  -dynamic colorings of graphs. Discrete Appl Math 206:65\u201372","DOI":"10.1016\/j.dam.2016.01.016"},{"issue":"1","key":"387_CR10","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/s10878-018-0288-4","volume":"36","author":"VL Kamga","year":"2018","unstructured":"Kamga VL, Wang WF, Wang Y, Chen M (2018) 2-Distance vertex-distinguishing index of subcubic graphs. J Comb Optim 36(1):108\u2013120","journal-title":"J Comb Optim"},{"key":"387_CR11","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1016\/j.dam.2013.03.005","volume":"161","author":"SJ Kim","year":"2013","unstructured":"Kim SJ, Lee SJ, Park WJ (2013) Dynamic coloring and list dynamic coloring of planar graphs. Discrete Appl Math 161:2207\u20132212","journal-title":"Discrete Appl Math"},{"key":"387_CR12","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1016\/j.disc.2006.03.052","volume":"306","author":"HJ Lai","year":"2006","unstructured":"Lai HJ, Lin J, Montgomery B, Tao Z, Fan SH (2006) Conditional colorings of graphs. Discrete Math 306:1997\u20132004","journal-title":"Discrete Math"},{"key":"387_CR13","first-page":"193","volume":"68","author":"HJ Lai","year":"2003","unstructured":"Lai HJ, Montgomery B, Poon H (2003) Upper bounds of dynamic coloring number. Ars Comb 68:193\u2013201","journal-title":"Ars Comb"},{"key":"387_CR14","unstructured":"Montgomery B (2001) Ph.D. dissertation, West Virginia University"},{"key":"387_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.disc.2013.10.001","volume":"315\u2013316","author":"HM Song","year":"2014","unstructured":"Song HM, Fan SH, Chen Y, Sun L, Lai HJ (2014) On \n                    \n                      \n                    \n                    $$r$$\n                    \n                      \n                        r\n                      \n                    \n                  -hued coloring of \n                    \n                      \n                    \n                    $$K_4$$\n                    \n                      \n                        \n                          K\n                          4\n                        \n                      \n                    \n                  -minor free graphs. Discrete Math 315\u2013316:47\u201352","journal-title":"Discrete Math"},{"key":"387_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.dam.2015.05.015","volume":"198","author":"HM Song","year":"2016","unstructured":"Song HM, Lai HJ, Wu JL (2016) On \n                    \n                      \n                    \n                    $$r$$\n                    \n                      \n                        r\n                      \n                    \n                  -hued coloring of planar graphs with girth at least 6. Discrete Appl Math 198:251\u2013263","journal-title":"Discrete Appl Math"},{"key":"387_CR17","unstructured":"Suil O (2011) Mathing, connectivity, and eigenvalues in regular graphs. Ph.D dissertation, University of Illinois"},{"issue":"1","key":"387_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10878-018-0280-z","volume":"36","author":"HJ Wang","year":"2018","unstructured":"Wang HJ, Liu B, Gai L, Du HW, Wu JL (2018) Minimum choosability of planar graphs. J Comb Optim 36(1):13\u201322","journal-title":"J Comb Optim"},{"issue":"2","key":"387_CR19","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10898-015-0360-x","volume":"65","author":"WF Wang","year":"2016","unstructured":"Wang WF, Huang DJ, Wang YW, Wang YQ, Du DZ (2016) A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. J Glob Optim 65(2):351\u2013367","journal-title":"J Glob Optim"},{"issue":"3","key":"387_CR20","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1007\/s10878-017-0243-9","volume":"35","author":"WF Wang","year":"2018","unstructured":"Wang WF, Wu TT, Hu XX, Wang YQ (2018) Planar graphs without chordal 5-cycles are 2-good. J Comb Optim 35(3):980\u2013996","journal-title":"J Comb Optim"},{"key":"387_CR21","unstructured":"Wenger G (1997) Graphs with given diameter and a coloring problem. Technical report, University of Dortmund"},{"key":"387_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2018.05.006","volume":"739","author":"WW Zhang","year":"2018","unstructured":"Zhang WW, Wu JL (2018) Edge coloring of planar graphs without adjacent 7-cycles. Theor Comput Sci 739:59\u201364","journal-title":"Theor Comput Sci"},{"issue":"2","key":"387_CR23","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/s10878-017-0187-0","volume":"35","author":"JL Zhu","year":"2018","unstructured":"Zhu JL, Bu YH, Dai Y (2018) Upper bounds for adjacent vertex-distinguishing edge coloring. J Comb Optim 35(2):454\u2013462","journal-title":"J Comb Optim"},{"issue":"1","key":"387_CR24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10878-018-0285-7","volume":"36","author":"JL Zhu","year":"2018","unstructured":"Zhu JL, Bu YH (2018) Minimum 2-distance coloring of planar graphs and channel assignment. J Comb Optim 36(1):55\u201364","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00387-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00387-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00387-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T19:15:40Z","timestamp":1582744540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00387-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,27]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["387"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00387-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,2,27]]},"assertion":[{"value":"27 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}