{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:34:54Z","timestamp":1774370094451,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441809","type":"print"},{"value":"9783540457497","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_64","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"736-747","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Frequency Channel Assignment on Planar Networks"],"prefix":"10.1007","author":[{"given":"Michael","family":"Molloy","sequence":"first","affiliation":[]},{"given":"Mohammad R.","family":"Salavatipour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"64_CR1","unstructured":"G. Agnarsson and M. M. Halld\u00f3rsson, Coloring powers of planar graphs, To appear in SIAM J. Disc. Math., Earlier version appeared in Proc. of the 11th annual ACM-SIAM Symp. on Disc. Alg., pages 654\u2013662, 2000."},{"key":"64_CR2","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender, T. Kloks, R.B. Tan, and J. Van Leeuwen, Approximations for \u03bb-Coloring of Graphs, In Proc. of 17th Annual Symp. on Theo. Aspc. Of Comp. Sci. pages 395\u2013406, Springer 2000.","DOI":"10.1007\/3-540-46541-3_33"},{"key":"64_CR3","unstructured":"O. Borodin, H. J. Broersma, A. Glebov, and J. Van Den Heuvel, Colouring at distance two in planar graphs, In preparation 2001."},{"key":"64_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"J. Chang","year":"1996","unstructured":"J. Chang and Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Disc. Math. 9:309\u2013316, 1996.","journal-title":"SIAM J. Disc. Math."},{"issue":"2","key":"64_CR5","first-page":"121","volume":"20","author":"D. A. Fotakis","year":"2001","unstructured":"D. A. Fotakis, S. E. Nikoletseas, V. G. Papadopoulou, and P. G. Spirakis, Hardness results and efficient approximations for frequency assignment problems: radio labeling and radio coloring, J. of Computers and Artificial intelligence, 20(2):121\u2013180, 2001.","journal-title":"J. of Computers and Artificial intelligence"},{"key":"64_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<47::AID-JGT7>3.0.CO;2-L","volume":"22","author":"J. P. Georges","year":"1996","unstructured":"J. P. Georges and D.W. Mauro, On the size of graphs labeled with a condition at distance two, J. Graph Theory, 22:47\u201357, 1996.","journal-title":"J. Graph Theory"},{"key":"64_CR7","first-page":"141","volume":"140","author":"J. P. Georges","year":"1999","unstructured":"J. P. Georges and D.W. Mauro, Some results on \u03bbi\n                           j-numbers of the products of complete graphs, Congr. Numer., 140:141\u2013160, 1999.","journal-title":"Congr. Numer."},{"key":"64_CR8","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J. R. Griggs","year":"1992","unstructured":"J. R. Griggs and R. K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Disc. Math., 5:586\u2013595, 1992.","journal-title":"SIAM J. Disc. Math."},{"key":"64_CR9","unstructured":"T. K. Jonas, Graph coloring analogues with a condition at distance two: L(2, 1)-labelings and list \u03bb-labelings, Ph.D. Thesis, University of South Carolina, 1993."},{"key":"64_CR10","unstructured":"S. Ramanathan and E. L. Lloyd, On the complexity of distance-2 coloring, In Proc. 4th Int. Conf. Comput. and Inform. pages 71\u201374, 1992."},{"issue":"2","key":"64_CR11","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/90.222924","volume":"1","author":"S. Ramanathan","year":"1993","unstructured":"S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multi-hop radio networks, IEEE\/ACM Trans. on Networking, 1(2):166\u2013172, 1993.","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"64_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2001.2046","volume":"83","author":"D.P. Sanders","year":"2001","unstructured":"D.P. Sanders and Y. Zhao, A new bound on the cyclic chromatic number, J. of Comb. Theory Series B 83:102\u2013111, 2001.","journal-title":"J. of Comb. Theory Series B"},{"key":"64_CR13","unstructured":"J. Van Den Heuvel and S McGuinness, Colouring the Square of a Planar Graph, Preprint."},{"key":"64_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","volume":"29","author":"J. Van Den Heuvel","year":"1998","unstructured":"J. Van Den Heuvel, R. A. Leese, and M. A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory, 29:263\u2013283, 1998.","journal-title":"J. Graph Theory"},{"key":"64_CR15","unstructured":"G. Wegner, Graphs with given diameter and a coloring problem, Technical report, University of Dortmond, 1977."},{"key":"64_CR16","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"A. Whittlesey","year":"1995","unstructured":"A. Whittlesey, J. P. Georges, and D. W. Mauro, On the \u03bb-number of Qn and related graphs, SIAM J. Disc. Math., 8:499\u2013506, 1995.","journal-title":"SIAM J. Disc. Math."},{"key":"64_CR17","unstructured":"S. A. Wong, Colouring Graphs with Respect to Distance, M.Sc. Thesis, Department of Combinatorics and Optimization, University of Waterloo, 1996."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T20:17:31Z","timestamp":1675714651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45749-6_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_64","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"29 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}