{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:29:18Z","timestamp":1710361758494},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T00:00:00Z","timestamp":1528329600000},"content-version":"tdm","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":[[2018,11]]},"DOI":"10.1007\/s10878-018-0312-8","type":"journal-article","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T05:48:12Z","timestamp":1528350492000},"page":"1411-1424","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["List 2-distance \n                \n                  \n                \n                $$\\varDelta +3$$\n                \n                  \n                    \n                      \u0394\n                      +\n                      3\n                    \n                  \n                \n              -coloring of planar graphs without 4,5-cycles"],"prefix":"10.1007","volume":"36","author":[{"given":"Haiyang","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Jingjun","family":"Sheng","sequence":"additional","affiliation":[]},{"given":"Xinzhong","family":"L\u00fc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,7]]},"reference":[{"issue":"3","key":"312_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00493-013-2573-2","volume":"33","author":"O Amini","year":"2013","unstructured":"Amini O, Esperet L, van den Heuvel J (2013) A unified approach to distance-two colouring of graphs on surfaces. Combinatorica 33(3):253\u2013296","journal-title":"Combinatorica"},{"key":"312_CR2","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 \n                    \n                      \n                    \n                    $$\\varDelta \\ge 17$$\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                    \n                      \n                    \n                    $$(\\varDelta + 2)$$\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":"312_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan, London"},{"key":"312_CR4","first-page":"180","volume":"394","author":"OV Borodin","year":"1989","unstructured":"Borodin OV (1989) On the total coloring of planar graphs. J Reine Angew Math 394:180\u2013185","journal-title":"J Reine Angew Math"},{"issue":"6","key":"312_CR5","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1007\/s11202-009-0106-4","volume":"50","author":"OV Borodin","year":"2009","unstructured":"Borodin OV, Ivanova AO (2009) List 2-distance \n                    \n                      \n                    \n                    $$\\varDelta +2$$\n                    \n                      \n                        \n                          \u0394\n                          +\n                          2\n                        \n                      \n                    \n                  -coloring of planar graphs with girth 6 and \n                    \n                      \n                    \n                    $$\\varDelta \\ge 24$$\n                    \n                      \n                        \n                          \u0394\n                          \u2265\n                          24\n                        \n                      \n                    \n                  . Sib Math J 50(6):958\u2013964","journal-title":"Sib Math J"},{"key":"312_CR6","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":"312_CR7","first-page":"129","volume":"1","author":"OV Borodin","year":"2004","unstructured":"Borodin OV, Glebov AN, Ivanova AO, Neustroeva TK, Tashkinov VA (2004) Sufficient conditions for the 2-distance \n                    \n                      \n                    \n                    $$(\\varDelta +1)$$\n                    \n                      \n                        \n                          (\n                          \u0394\n                          +\n                          1\n                          )\n                        \n                      \n                    \n                  -colorability of plane graphs. Sib Elektron Mat Izv 1:129\u2013141 (in Russian)","journal-title":"Sib Elektron Mat Izv"},{"key":"312_CR8","first-page":"355","volume":"3","author":"OV Borodin","year":"2006","unstructured":"Borodin OV, Ivanova AO, Neustroeva TK (2006) List \n                    \n                      \n                    \n                    $$(p, q)$$\n                    \n                      \n                        \n                          (\n                          p\n                          ,\n                          q\n                          )\n                        \n                      \n                    \n                  -coloring of sparse planar graphs. Sib Elektron Mat Izv 3:355\u2013361 (in Russian)","journal-title":"Sib Elektron Mat Izv"},{"issue":"4","key":"312_CR9","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1002\/jgt.22101","volume":"85","author":"D Cranston","year":"2017","unstructured":"Cranston D, Jaeger B (2017) List-coloring the squares of planar graphs without 4-cycles and 5-cycles. J Graph Theory 85(4):721\u2013737","journal-title":"J Graph Theory"},{"key":"312_CR10","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\u00e1l D, Nejedl\u00fd P, Sk\u030crekovski R (2008) Coloring squares of planar graphs with girth six. Eur J Combin 29:838\u2013849","journal-title":"Eur J Combin"},{"key":"312_CR11","doi-asserted-by":"publisher","first-page":"2646","DOI":"10.1016\/j.dam.2008.08.024","volume":"157","author":"JR Griggs","year":"2009","unstructured":"Griggs JR, Kr\u00e1l D (2009) Graph labellings with variable weights, a survey. Discrete Appl Math 157:2646\u20132658","journal-title":"Discrete Appl Math"},{"key":"312_CR12","doi-asserted-by":"publisher","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"},{"key":"312_CR13","doi-asserted-by":"publisher","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"},{"issue":"2","key":"312_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1134\/S1990478911020098","volume":"5","author":"AO Ivanova","year":"2011","unstructured":"Ivanova AO (2011) List 2-distance \n                    \n                      \n                    \n                    $$(\\varDelta +1)$$\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):130\u2013221","journal-title":"J Appl Ind Math"},{"key":"312_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0012-365X(00)00371-X","volume":"240","author":"AV Kostochka","year":"2001","unstructured":"Kostochka AV, Woodall DR (2001) Choosability conjectures and multicircuits. Discrete Math 240:123\u2013143","journal-title":"Discrete Math"},{"key":"312_CR16","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.disc.2006.11.059","volume":"308","author":"F Kramer","year":"2008","unstructured":"Kramer F, Kramer H (2008) A survey on the distance-colouring of graphs. Discrete Math 308:422\u2013426","journal-title":"Discrete Math"},{"key":"312_CR17","doi-asserted-by":"publisher","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 Combin Theory Ser B 94:189\u2013213","journal-title":"J Combin Theory Ser B"},{"key":"312_CR18","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J Heuvel van den","year":"2003","unstructured":"van den Heuvel J, McGuinness S (2003) Coloring of the square of a planar graph. J Graph Theory 42:110\u2013124","journal-title":"J Graph Theory"},{"key":"312_CR19","unstructured":"Wegner G (1977) Graphs with given diameter and coloring problem. Technical Report, University of Dortmund"},{"key":"312_CR20","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/10080453X","volume":"26","author":"HY Zhu","year":"2012","unstructured":"Zhu HY, Lu XZ, Wang CQ, Chen M (2012) Labelling planar graphs without 4,5-cycles with a condition on distance two. SIAM J Discrete Math 26:52\u201364","journal-title":"SIAM J Discrete Math"},{"key":"312_CR21","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.dam.2013.08.039","volume":"162","author":"HY Zhu","year":"2014","unstructured":"Zhu HY, Hou LF, C W, LU XZ (2014) The \n                    \n                      \n                    \n                    $$L(p, q)$$\n                    \n                      \n                        \n                          L\n                          (\n                          p\n                          ,\n                          q\n                          )\n                        \n                      \n                    \n                  -labelling of planar graphs without 4-cycles. J Discrete Appl Math 162:355\u2013363","journal-title":"J Discrete Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0312-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0312-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0312-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T19:20:44Z","timestamp":1559848844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0312-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,7]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["312"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0312-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,7]]},"assertion":[{"value":"7 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}