{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:43Z","timestamp":1725564823038},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_13","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T17:47:42Z","timestamp":1283708862000},"page":"138-148","source":"Crossref","is-referenced-by-count":0,"title":["No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ondrej","family":"S\u00fdkora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bertossi, A.A., Pinotti, C.M., Tan, R.B.: Efficient use of radio spectrum in wireless networks with channel separation between close stations. In: Proc. DIAL M for Mobility 2000 (Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications) (2000)","DOI":"10.1145\/345848.345853"},{"key":"13_CR2","first-page":"28","volume-title":"Proc. IPDPS 2002 (International Parallel and Distributed Processing Symposium)","author":"A.A. Bertossi","year":"2002","unstructured":"Bertossi, A.A., Pinotti, C.M., Tan, R.B.: Channel assignment with separation for special classes of wireless networks: Grids and rings. In: Proc. IPDPS 2002 (International Parallel and Distributed Processing Symposium), pp. 28\u201333. IEEE Computer Society, Los Alamitos (2002)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/3-540-46541-3_33","volume-title":"STACS 2000","author":"H.L. Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: \u03bb-coloring of graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 395\u2013406. Springer, Heidelberg (2000)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Calamoneri, T., Petreschi, R.: L(2, 1)-labeling of planar graphs. In: Proc. DIAL M for Mobility 2001 (Fifth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications), pp. 28\u201333 (2001)","DOI":"10.1145\/381448.381452"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(99)00400-8","volume":"220","author":"G.J. Chang","year":"2002","unstructured":"Chang, G.J., Ke, W.-T., Kuo, D., Liu, D.D.-F., Yeh, R.K.: On L(d1)-labelings of graphs. Discrete Mathematics\u00a0220, 57\u201366 (2002)","journal-title":"Discrete Mathematics"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G.J. Chang","year":"1996","unstructured":"Chang, G.J., Kuo, D.: The L(2, 1)-labeling on graphs. SIAM J. Discrete Math.\u00a09, 309\u2013316 (1996)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR7","unstructured":"Fertin, G., Raspaud, R.: L(p,q) labeling of d-dimensional grids. Discrete Mathematics (2003)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labeling graphs with a condition at distance two. SIAM J. Discrete Math.\u00a05, 586\u2013595 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"60","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE\u00a060, 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1109\/81.886984","volume":"47","author":"P.K. Jha","year":"2000","unstructured":"Jha, P.K.: Optimal L(2, 1)-labeling of cartesian products of cycles with an application to independent domination. IEEE Trans. Circuits & Systems I: Fundamental Theory and Appl.\u00a047, 1531\u20131534 (2000)","journal-title":"IEEE Trans. Circuits & Systems I: Fundamental Theory and Appl."},{"key":"13_CR11","first-page":"81","volume":"55","author":"P.K. Jha","year":"2000","unstructured":"Jha, P.K., Narayanan, A., Sood, P., Sundaram, K., Sunder, V.: On L(2, 1)-labeling of the cartesian product of a cycle and a path. Ars Combin.\u00a055, 81\u201389 (2000)","journal-title":"Ars Combin."},{"key":"13_CR12","unstructured":"Metzger, B.H.: Spectrum management technique. In: Paper presented at the 38th National ORSA Meeting, Detroit, MI (1970)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/3-540-45749-6_64","volume-title":"Algorithms - ESA 2002","author":"M. Molloy","year":"2002","unstructured":"Molloy, M., Salavatipour, M.R.: Frequency channel assignment on planar networks. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 736\u2013747. Springer, Heidelberg (2002)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D. Sakai","year":"1994","unstructured":"Sakai, D.: Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math.\u00a07, 133\u2013140 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s000260200017","volume":"6","author":"J. Heuvel van den","year":"2002","unstructured":"van den Heuvel, J.: Radio channel assignment on 2-dimensional lattices. Annals of Combinatorics\u00a06, 463\u2013477 (2002)","journal-title":"Annals of Combinatorics"},{"key":"13_CR16","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. Heuvel van den","year":"1998","unstructured":"van den Heuvel, J., Leese, R.A., Shepherd, M.A.: Graph labelling and radio channel assignment. Journal of Graph Theory\u00a029, 263\u2013284 (1998)","journal-title":"Journal of Graph Theory"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"M. Whittlesey","year":"1995","unstructured":"Whittlesey, M., Georges, J., Mauro, D.W.: On the \u03bb-number of Q n and related graphs. SIAM J. Discrete Math.\u00a08, 499\u2013506 (1995)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:20:55Z","timestamp":1605741655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}