{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:23:10Z","timestamp":1762507390834,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T00:00:00Z","timestamp":1522627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771403"],"award-info":[{"award-number":["11771403"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10898-018-0647-9","type":"journal-article","created":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T00:52:47Z","timestamp":1522630367000},"page":"539-552","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal channel assignment and L(p,\u00a01)-labeling"],"prefix":"10.1007","volume":"72","author":[{"given":"Junlei","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Yuehua","family":"Bu","sequence":"additional","affiliation":[]},{"given":"Miltiades P.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[]},{"given":"Huijuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,2]]},"reference":[{"key":"647_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"FS Roberts","year":"1991","unstructured":"Roberts, F.S.: T-colorings of a graphs: recent results and open problems. Discrete Math. 93, 229\u2013245 (1991)","journal-title":"Discrete Math."},{"key":"647_CR2","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5, 586\u2013595 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"647_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"647_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM J. Discrete Math. 9, 309\u2013316 (1996)","journal-title":"SIAM J. Discrete Math."},{"key":"647_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(99)00400-8","volume":"220","author":"GJ Chang","year":"2002","unstructured":"Chang, G.J., Ke, W.-T., Kuo, D., Liu, D.D.-F., Yeh, R.K.: On L(d,1)-labelings of graphs. Discrete Math. 220, 57\u201366 (2002)","journal-title":"Discrete Math."},{"key":"647_CR6","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/j.disc.2007.07.075","volume":"308","author":"D Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves, D.: On the \n                    \n                      \n                    \n                    $$L(p,1)$$\n                    \n                      \n                        \n                          L\n                          (\n                          p\n                          ,\n                          1\n                          )\n                        \n                      \n                    \n                  -labelling of graphs. Discrete Math. 308, 1405\u20131414 (2008)","journal-title":"Discrete Math."},{"key":"647_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1137\/090763998","volume":"26","author":"F Havet","year":"2012","unstructured":"Havet, F., Reed, B., Sereni, J.S.: Griggs and Yehs conjecture and \n                    \n                      \n                    \n                    $$L(p,1)$$\n                    \n                      \n                        \n                          L\n                          (\n                          p\n                          ,\n                          1\n                          )\n                        \n                      \n                    \n                  -labelings. SIAM J. Discrete Math. 26, 145\u2013168 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"647_CR8","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1016\/j.ejc.2007.04.019","volume":"28","author":"P Bella","year":"2007","unstructured":"Bella, P., Kr\u00e1l, D., Mohar, B., Quittnerov\u00e1, K.: Labeling planar graphs with a condition at distance two. Eur. J. Comb. 28, 2201\u20132239 (2007)","journal-title":"Eur. J. Comb."},{"key":"647_CR9","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J den Heuvel van","year":"2003","unstructured":"van den Heuvel, J., McGuinness, S.: Coloring the square of a planar graph. J. Graph Theory 42, 110\u2013124 (2003)","journal-title":"J. Graph Theory"},{"key":"647_CR10","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, M.: A bound on the chromatic number of the square of a planar graph. J. Comb. Theory Ser. B. 94, 189\u2013213 (2005)","journal-title":"J. Comb. Theory Ser. B."},{"key":"647_CR11","unstructured":"Borodin, O., Broersma, H.J., Glebov, A., van den Heuvel, J.: Stars and bunches in planar graphs. Part II: general planar graphs and colourings. CDAM Research Report 2002-05 (2002)"},{"key":"647_CR12","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/S0895480101390448","volume":"17","author":"WF Wang","year":"2003","unstructured":"Wang, W.F., Lih, K.: Labeling planar graphs with conditions on girth and distance two. SIAM J. Discrete Math. 17, 264\u2013275 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"647_CR13","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l, D., Nejedl\u00fd, P., \u0160krekovski, R.: Coloring squares of planar graphs with no short cycles. Preprint series, vol. 43, p. 976 (2005)"},{"key":"647_CR14","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/10080453X","volume":"26","author":"HY Zhu","year":"2012","unstructured":"Zhu, H.Y., Lv, X.Z., Wang, C.Q., Chen, M.: Labelling planar graphs without 4,5-cycles with a condition on distance two. SIAM J. Discrete Math. 26, 52\u201364 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"647_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.dam.2013.08.039","volume":"162","author":"HY Zhu","year":"2014","unstructured":"Zhu, H.Y., Hou, L.F., Chen, W., Lv, X.Z.: L(p, q)-labelling of planar graphs without 4-cycles. Discrete Appl. Math. 162, 355\u2013363 (2014)","journal-title":"Discrete Appl. Math."},{"key":"647_CR16","unstructured":"Wenger, G.: Graphs with given diameter and a coloring problem. Technical Report, University of Dortmund (1977)"},{"key":"647_CR17","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s10878-011-9409-z","volume":"24","author":"YH Bu","year":"2012","unstructured":"Bu, Y.H., Zhu, X.B.: An optimal square coloring of planar graphs. J. Comb. Optim. 24, 580\u2013592 (2012)","journal-title":"J. Comb. Optim."},{"key":"647_CR18","first-page":"645","volume":"32","author":"W Dong","year":"2016","unstructured":"Dong, W., Lin, W.S.: An improved bound on 2-distance coloring plane graphs with girth 5. Discrete Appl. Math. 32, 645\u2013655 (2016)","journal-title":"Discrete Appl. Math."},{"key":"647_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.dam.2013.08.025","volume":"162","author":"D Cranston","year":"2014","unstructured":"Cranston, D., \u0160krekovski, R.: Sufficient sparseness conditions for \n                    \n                      \n                    \n                    $$G^{2}$$\n                    \n                      \n                        \n                          G\n                          2\n                        \n                      \n                    \n                   to be \n                    \n                      \n                    \n                    $$(\\Delta +1)$$\n                    \n                      \n                        \n                          (\n                          \u0394\n                          +\n                          1\n                          )\n                        \n                      \n                    \n                  -choosable when \n                    \n                      \n                    \n                    $$\\Delta \\ge 5$$\n                    \n                      \n                        \n                          \u0394\n                          \u2265\n                          5\n                        \n                      \n                    \n                  . Discrete Appl. Math. 162, 167\u2013176 (2014)","journal-title":"Discrete Appl. Math."},{"key":"647_CR20","doi-asserted-by":"crossref","unstructured":"Gomes, F.C., Pardalos, P.M., Oliveira, C.S., Resende, M.G.C.: Reactive GRASP with path relinking for channel assignment in mobile phone networks. In: Proceedings of the 5th international workshop on discrete algorithms and methods for mobile computing and communications, pp. 60\u201367 (2001)","DOI":"10.1145\/381448.381456"},{"issue":"1","key":"647_CR21","doi-asserted-by":"publisher","first-page":"1750013","DOI":"10.1142\/S1793830917500136","volume":"9","author":"Bu Yuehua","year":"2017","unstructured":"Yuehua, Bu, Zhu, Hongguo: Strong edge-coloring of cubic planar graphs. Discrete Math. Algorithms Appl. 9(1), 1750013 (2017)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"1","key":"647_CR22","doi-asserted-by":"publisher","first-page":"1750011","DOI":"10.1142\/S1793830917500112","volume":"9","author":"J Jin","year":"2017","unstructured":"Jin, J., Wei, Y.: A note on 3-choosability of planar graphs under distance restrictions. Discrete Math. Algorithms Appl. 9(1), 1750011 (2017)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"3","key":"647_CR23","doi-asserted-by":"publisher","first-page":"1750031","DOI":"10.1142\/S1793830917500318","volume":"9","author":"N Karst","year":"2017","unstructured":"Karst, N., Langowitz, J., Oehrlein, J., Troxell, D.S.: Radio \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -chromatic number of cycles for large \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  . Discrete Math. Algorithms Appl. 9(3), 1750031 (2017)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"4","key":"647_CR24","doi-asserted-by":"publisher","first-page":"1550040","DOI":"10.1142\/S1793830915500408","volume":"7","author":"PC Lisna","year":"2015","unstructured":"Lisna, P.C., Sunitha, M.S.: \n                    \n                      \n                    \n                    $$b$$\n                    \n                      \n                        b\n                      \n                    \n                  -Chromatic sum of a graph. Discrete Math. Algorithms Appl. 7(4), 1550040 (2015)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"2","key":"647_CR25","doi-asserted-by":"publisher","first-page":"1650034","DOI":"10.1142\/S1793830916500348","volume":"8","author":"N Pleanmani","year":"2016","unstructured":"Pleanmani, N., Panma, S.: Bounds for the dichromatic number of a generalized lexicographic product of digraphs. Discrete Math. Algorithms Appl. 8(2), 1650034 (2016)","journal-title":"Discrete Math. Algorithms Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0647-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0647-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0647-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T19:06:10Z","timestamp":1554145570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0647-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,2]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0647-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,4,2]]},"assertion":[{"value":"16 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}