{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:25:54Z","timestamp":1694633154636},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s11390-008-9161-8","type":"journal-article","created":{"date-parts":[[2008,8,6]],"date-time":"2008-08-06T22:26:42Z","timestamp":1218061602000},"page":"652-659","source":"Crossref","is-referenced-by-count":1,"title":["A General Approach to L(h,k)-Label Interconnection Networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Tiziana","family":"Calamoneri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saverio","family":"Caminiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,5]]},"reference":[{"key":"9161_CR1","first-page":"1031","volume-title":"Graph Theory, Combinatorics, and Applications, 2","author":"F S Roberts","year":"1991","unstructured":"Roberts F S. From Garbage to Rainbows: Generalizations of Graph Coloring and Their Applications. Graph Theory, Combinatorics, and Applications, 2, Alavi Y, Chartrand G, Oellermann O R, Schwenk A J (eds.), 2, New York: Wiley, 1991, pp.1031\u20131052."},{"key":"9161_CR2","volume-title":"Graph Coloring Problems","author":"T R Jensen","year":"1995","unstructured":"Jensen T R, Toft B. Graph Coloring Problems. New York: John Wiley & Sons, 1995."},{"issue":"4","key":"9161_CR3","doi-asserted-by":"crossref","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 2. SIAM Journal on Discrete Mathematics 1992, 5(4): 586\u2013595.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9161_CR4","first-page":"141","volume":"109","author":"J P Georges","year":"1995","unstructured":"Georges J P, Mauro D W. Generalized vertex labelings with a condition at distance two. Congressus Numerantium, 1995, 109: 141\u2013159.","journal-title":"Congressus Numerantium"},{"key":"9161_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.46298\/dmtcs.361","volume":"8","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T. Exact solution of a class of frequency assignment problems in cellular networks. Discrete Mathematics & Theoretical Computer Science, 2006, 8: 141\u2013158.","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"issue":"14","key":"9161_CR6","doi-asserted-by":"crossref","first-page":"1534","DOI":"10.1016\/j.disc.2005.04.024","volume":"306","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T, Pelc A, Petreschi R: Labeling trees with a condition at distance two. Discrete Mathematics, 2006, 306(14): 1534\u20131539.","journal-title":"Discrete Mathematics"},{"issue":"1\u20133","key":"9161_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0012-365X(02)00750-1","volume":"269","author":"J P Georges","year":"2003","unstructured":"Georges J P, Mauro D W. Labeling trees with a condition at distance two. Discrete Mathematics, 2003, 269(1\u20133): 127\u2013148.","journal-title":"Discrete Mathematics"},{"issue":"1","key":"9161_CR8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/S0895480199351859","volume":"14","author":"J P Georges","year":"2001","unstructured":"Georges J P, Mauro D W, Stein M I. Labeling products of complete graphs with a condition at distance two. SIAM Journal on Discrete Mathematics, 2001, 14(1): 28\u201335.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"9161_CR9","doi-asserted-by":"crossref","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":"J van den Heuvel, R A Leese, M A Shepherd. Graph labelling and radio channel assignment. Journal of Graph Theory, 1998, 29(4): 263\u2013283.","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"9161_CR10","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1137\/S0895480100367950","volume":"16","author":"G Agnarsson","year":"2003","unstructured":"Agnarsson G, Halld\u00f3rsson M M. Coloring powers of planar graphs. SIAM Journal on Discrete Mathematics, 2003, 16(4): 651\u2013662.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"12","key":"9161_CR11","first-page":"1487","volume":"68","author":"W K Hale","year":"1980","unstructured":"Hale W K. Frequency assignment: Theory and application. Proceedings of the IEEE, 1980, 68(12): 1487\u20131514.","journal-title":"Proceedings of the IEEE"},{"key":"9161_CR12","unstructured":"K I Aardal, S P M van Hoesel, A M C A Koster, C Mannino, A Sassano. Models and solution techniques for frequency assignment problems. ZIB-Report 01-40, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, 2001."},{"key":"9161_CR13","doi-asserted-by":"crossref","unstructured":"H L Bodlaender, T Kloks, R B Tan, J van Leeuwen. Lambda coloring of graphs. In Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), Lille, France, LNCS 1770, Feb. 2000, pp.395\u2013406.","DOI":"10.1007\/3-540-46541-3_33"},{"issue":"3","key":"9161_CR14","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.jpdc.2003.11.005","volume":"64","author":"T Calamoneri","year":"2004","unstructured":"Calamoneri T, Petreschi R. L(2, 1)-labeling of planar graphs. Journal on Parallel and Distributed Computing, 2004, 64(3): 414\u2013426.","journal-title":"Journal on Parallel and Distributed Computing"},{"key":"9161_CR15","doi-asserted-by":"crossref","first-page":"2445","DOI":"10.1016\/j.dam.2006.03.036","volume":"154","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T, Petreschi R. \u03bb-coloring matrogenic graphs. Discrete Applied Mathematics, 2006, 154: 2445\u20132457.","journal-title":"Discrete Applied Mathematics"},{"key":"9161_CR16","doi-asserted-by":"crossref","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 problem on graphs. SIAM Journal on Discrete Mathematics, 1996, 9: 309\u2013316.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9161_CR17","doi-asserted-by":"crossref","unstructured":"Fiala J, Kloks T, Kratochv\u00edl J. Fixed-parameter complexity of \u03bb-colorings. In Proc. Graph Theoretic Concepts in Computer Science (WG\u201999), LNCS 1665, 1999, pp.350\u2013363.","DOI":"10.1007\/3-540-46784-X_33"},{"key":"9161_CR18","doi-asserted-by":"crossref","unstructured":"Murphey R A, Pardalos P M, Resende M G C. Frequency Assignment Problems. Handbook of Combinatorial Optimization, Du D-Z, Pardalos P M (eds.), Kluwer Academic Publishers, 1999, pp.295\u2013377.","DOI":"10.1007\/978-1-4757-3023-4_6"},{"issue":"1","key":"9161_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D Sakai","year":"1994","unstructured":"Sakai D. Labeling chordal graphs: Distance 2 condition. SIAM Journal on Discrete Mathematics, 1994, 7(1): 133\u2013140.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9161_CR20","unstructured":"Shepherd M. Radio channel assignment [Dissertation]. Merton College, Oxford, 1998."},{"issue":"4","key":"9161_CR21","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"M A Whittlesey","year":"1995","unstructured":"Whittlesey M A, Georges J P, Mauro D W. On the \u03bb number of Q n and related graphs. SIAM Journal on Discrete Mathematics, 1995, 8(4): 499\u2013506.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"5","key":"9161_CR22","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T. The L(h, k)-labelling problem: A survey and annotated bibliography. The Computer Journal, 2006, 49(5): 585\u2013608, http:\/\/www.dsi.uniroma1.it\/\u223ccalamo\/survey.html .","journal-title":"The Computer Journal"},{"key":"9161_CR23","doi-asserted-by":"crossref","unstructured":"Leighton F T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"issue":"5","key":"9161_CR24","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F P Preparata","year":"1981","unstructured":"Preparata F P, Vuillemin J. The cube-connected cycles: A versatile network for parallel computation. Communications of ACM, 1981, 24(5): 300\u2013309.","journal-title":"Communications of ACM"},{"issue":"1","key":"9161_CR25","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.jpdc.2003.09.003","volume":"64","author":"T Calamoneri","year":"2004","unstructured":"Calamoneri T, Massini A. Efficient algorithms for checking the equivalence of multistage interconnection networks. Journal on Parallel and Distributed Computing, 2004, 64(1): 135\u2013150.","journal-title":"Journal on Parallel and Distributed Computing"},{"issue":"5","key":"9161_CR26","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0020-0190(97)00027-6","volume":"61","author":"T Calamoneri","year":"1997","unstructured":"Calamoneri T, Petreschi R. A new 3D representation of trivalent Cayley networks. Information Processing Letters, 1997, 61(5): 247\u2013252.","journal-title":"Information Processing Letters"},{"issue":"6","key":"9161_CR27","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0020-0190(95)00068-N","volume":"54","author":"P Vadapalli","year":"1995","unstructured":"Vadapalli P, Srimani P K. Trivalent Cayley graphs for interconnection networks. Information Processing Letters, 1995, 54(6): 329\u2013335.","journal-title":"Information Processing Letters"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9161-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-008-9161-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9161-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T12:07:20Z","timestamp":1631621240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-008-9161-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9161"],"URL":"https:\/\/doi.org\/10.1007\/s11390-008-9161-8","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}