{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:44Z","timestamp":1759638704646},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,23]],"date-time":"2017-02-23T00:00:00Z","timestamp":1487808000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10878-017-0118-0","type":"journal-article","created":{"date-parts":[[2017,2,23]],"date-time":"2017-02-23T08:55:08Z","timestamp":1487840108000},"page":"874-890","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On list r-hued coloring of planar graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Haiyang","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianying","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinzhong","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,23]]},"reference":[{"key":"118_CR1","doi-asserted-by":"crossref","first-page":"3005","DOI":"10.1016\/j.dam.2009.05.002","volume":"157","author":"S Akbari","year":"2009","unstructured":"Akbari S, Ghanbari M, Jahanbekam S (2009) On the list dynamic coloring of graphs. Discrete Appl Math 157:3005\u20133007","journal-title":"Discrete Appl Math"},{"key":"118_CR2","doi-asserted-by":"crossref","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 \n                        $$\\varDelta \\ge 17$$\n                        \n                            \n                                            \n                                \n                                    \u0394\n                                    \u2265\n                                    17\n                                \n                            \n                        \n                     and maximum average degree less than 3 are list 2-distance \n                        $$(\\varDelta + 2)$$\n                        \n                            \n                                            \n                                \n                                    (\n                                    \u0394\n                                    +\n                                    2\n                                    )\n                                \n                            \n                        \n                    -colorable. Discrete Math 317:19\u201332","journal-title":"Discrete Math"},{"key":"118_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murry USR (2008) Graph theory. Springer, New York"},{"key":"118_CR4","unstructured":"Borodin OV, Broersma HJ, Glebov A, van den Heuvel J (2002) Stars and bunches in planar graphs. Part: General planar graphs and colorings, Technical Report, London School of Economics"},{"key":"118_CR5","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.dam.2012.01.012","volume":"160","author":"Y Chen","year":"2012","unstructured":"Chen Y, Fan S-H, Lai H-J, Song H-M, 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":"118_CR6","first-page":"7","volume":"29","author":"C Ding","year":"2008","unstructured":"Ding C, Fan S-H, Lai HJ (2008) Upper bound on conditional chromatic number of graphs. J Jinan Univ 29:7\u201314","journal-title":"J Jinan Univ"},{"key":"118_CR7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.endm.2007.07.079","volume":"29","author":"F Havet","year":"2007","unstructured":"Havet F, van den Heuvel J, McDiarmid C, Reed B (2007) List colouring squares of planar graphs. Electron Notes Discrete Math 29:515\u2013519","journal-title":"Electron Notes Discrete Math"},{"key":"118_CR8","doi-asserted-by":"crossref","first-page":"3553","DOI":"10.1016\/j.disc.2007.12.100","volume":"309","author":"F Havet","year":"2009","unstructured":"Havet F (2009) Choosability of the square of planar subcubic graphs with large girth. Discrete Math 309:3553\u20133563","journal-title":"Discrete Math"},{"issue":"2","key":"118_CR9","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1134\/S1990478911020098","volume":"5","author":"AO Ivanova","year":"2011","unstructured":"Ivanova AO (2011) List 2-distance \n                        $$(\\varDelta +1)$$\n                        \n                            \n                                            \n                                \n                                    (\n                                    \u0394\n                                    +\n                                    1\n                                    )\n                                \n                            \n                        \n                    -coloring of planar graphs with girth at least 7. J Appl Ind Math 5(2):22\u201336","journal-title":"J Appl Ind Math"},{"key":"118_CR10","first-page":"193","volume":"68","author":"H-J Lai","year":"2003","unstructured":"Lai H-J, Montgomery B, Poon H (2003) Upper bounds of dynamic chromatic number. Ars Comb 68:193\u2013201","journal-title":"Ars Comb"},{"key":"118_CR11","doi-asserted-by":"crossref","first-page":"1997","DOI":"10.1016\/j.disc.2006.03.052","volume":"306","author":"H-J Lai","year":"2006","unstructured":"Lai H-J, Lin J, Montgomery B, Tao Z, Fan S-H (2006) Conditional colorings of graphs. Discrete Math 306:1997\u20132004","journal-title":"Discrete Math"},{"key":"118_CR12","unstructured":"Lin Y (2008) Upper bounds of conditional chromatics number, Master Thesis, Jinan University"},{"key":"118_CR13","doi-asserted-by":"crossref","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":"118_CR14","unstructured":"Montgomery B (2001) Ph.D. Dissertation, West Virginia University"},{"key":"118_CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.disc.2013.10.001","volume":"315\u2013316","author":"H-M Song","year":"2014","unstructured":"Song H-M, Fan S-H, Chen Y, Sun L, Lai H-J (2014) On \n                        $$r$$\n                        \n                            \n                                            \n                                r\n                            \n                        \n                    -hued coloring of \n                        $$K_4$$\n                        \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":"118_CR16","unstructured":"Wegner G (1977) Graphs with given diameter and coloring problem, Technical Report, University of Dortmund"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0118-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0118-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0118-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T08:37:34Z","timestamp":1505983054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0118-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,23]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["118"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0118-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,23]]}}}