{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:55:37Z","timestamp":1768316137463,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,23]],"date-time":"2013-06-23T00:00:00Z","timestamp":1371945600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10878-013-9639-3","type":"journal-article","created":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T11:27:42Z","timestamp":1371900462000},"page":"139-149","source":"Crossref","is-referenced-by-count":16,"title":["Radio number for the product of a path and a complete graph"],"prefix":"10.1007","volume":"30","author":[{"given":"Byeong Moon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Woonjae","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung Chul","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,23]]},"reference":[{"key":"9639_CR1","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1093\/comjnl\/bxr037","volume":"54","author":"T Calamoneri","year":"2011","unstructured":"Calamoneri T (2011) The L(h, k)-Labelling Problem: an updated survey and annotated bibliography. Compd J 54:1344\u20131371","journal-title":"Compd J"},{"key":"9639_CR2","unstructured":"Calamoneri T, Vocca P (2005) Approximability of the $$L(h, k)$$ L ( h , k ) -labeling problem. In Proceedings 12th Colloq. on structural information and communication complexity(SIROCCO) Le Mont Saint-Michel, France, LNCS 3499, Springer, pp 65\u201377."},{"key":"9639_CR3","first-page":"77","volume":"33","author":"G Chartrand","year":"2001","unstructured":"Chartrand G, Erwin D, Zhang P, Harary F (2001) Radio labelings of graphs. Bull Inst Combin Appl 33:77\u201385","journal-title":"Bull Inst Combin Appl"},{"key":"9639_CR4","first-page":"141","volume":"140","author":"JP Georges","year":"1999","unstructured":"Georges JP, Mauro DW (1999) Some results on $$\\lambda ^j_k$$ \u03bb k j -numbers of the products of complete graphs, Proceedings of the thirtieth southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, FL, 1999). Congr Numer 140:141\u2013160","journal-title":"Congr Numer"},{"key":"9639_CR5","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/S0895480199351859","volume":"14","author":"JP Georges","year":"2001","unstructured":"Georges JP, Mauro DW, Stein MI (2001) Labeling products of complete graphs with a condition at distance two. SIAM J Discret Math 14:28\u201335","journal-title":"SIAM J Discret Math"},{"key":"9639_CR6","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance two. SIAM J Discret Math 5:586\u2013595","journal-title":"SIAM J Discret Math"},{"key":"9639_CR7","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68:1497\u20131514","journal-title":"Proc IEEE"},{"key":"9639_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.dam.2005.04.007","volume":"152","author":"PK Jha","year":"2005","unstructured":"Jha PK, Klav\u017ear S, Vesel A (2005) Optimal $$L(d,1)$$ L ( d , 1 ) -labelings of certain direct products of cycles and Cartesian products of cycles. Discret Appl Math 152:257\u2013265","journal-title":"Discret Appl Math"},{"issue":"1","key":"9639_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.11650\/tjm.17.2013.1909","volume":"17","author":"BM Kim","year":"2013","unstructured":"Kim BM, Song BC, Hwang W (2013) Distance three labelings for direct products of 3 complete graphs. Taiwanese J Math 17(1):207\u2013219","journal-title":"Taiwanese J Math"},{"key":"9639_CR10","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1016\/j.camwa.2010.07.058","volume":"60","author":"SR Kola","year":"2010","unstructured":"Kola SR, Panigrahi P (2010) An improved lower bound for the radio k-chromatic number of the hypercube $$Q_n$$ Q n . Comput Math Appl 60:2131\u20132140","journal-title":"Comput Math Appl"},{"key":"9639_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10878-007-9057-5","volume":"14","author":"PCB Lam","year":"2007","unstructured":"Lam PCB, Lin W, Wu J (2007) $$L(j, k)$$ L ( j , k ) labelings for the products of complete graphs. J Comb Optim 14:219\u2013227","journal-title":"J Comb Optim"},{"key":"9639_CR12","doi-asserted-by":"crossref","first-page":"3805","DOI":"10.1016\/j.disc.2007.06.046","volume":"308","author":"W Lin","year":"2008","unstructured":"Lin W, Lam PCB (2008) Distance two labeling and direct products of graphs. Discret Math 308:3805\u20133815","journal-title":"Discret Math"},{"key":"9639_CR13","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/j.disc.2007.03.066","volume":"308","author":"DD Liu","year":"2008","unstructured":"Liu DD (2008) Radio number for trees. Discret Math 308:1153\u20131164","journal-title":"Discret Math"},{"key":"9639_CR14","first-page":"307","volume":"90","author":"DD Liu","year":"2009","unstructured":"Liu DD, Xie M (2009) Radio number for square paths. Ars Comb 90:307\u2013319","journal-title":"Ars Comb"},{"key":"9639_CR15","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1137\/S0895480102417768","volume":"19","author":"DD Liu","year":"2005","unstructured":"Liu DD, Zhu X (2005) Multilevel distance labelings for paths and cycles. SIAM J Discret Math 19:610\u2013621","journal-title":"SIAM J Discret Math"},{"key":"9639_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D Sakai","year":"1994","unstructured":"Sakai D (1994) Labelling chordal graphs: Distance two condition. SIAM J Discret Math 7:133\u2013140","journal-title":"SIAM J Discret Math"},{"key":"9639_CR17","first-page":"20262034","volume":"88","author":"H Wang","year":"2011","unstructured":"Wang H, Xu X, Yang Y, Zhang B, Luo M, Wang G (2011) Radio number of ladder graphs. Int J Comput Math 88:20262034","journal-title":"Int J Comput Math"},{"key":"9639_CR18","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/j.disc.2005.11.029","volume":"306","author":"RK Yeh","year":"2006","unstructured":"Yeh RK (2006) A survey on labeling graphs with a condition two. Discret Math 306:1217\u20131231","journal-title":"Discret Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9639-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9639-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9639-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T02:27:21Z","timestamp":1563244041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9639-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,23]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9639"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9639-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,23]]}}}