{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:21:43Z","timestamp":1762176103615},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T00:00:00Z","timestamp":1178150400000},"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":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9057-5","type":"journal-article","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:51:02Z","timestamp":1178211062000},"page":"219-227","source":"Crossref","is-referenced-by-count":18,"title":["L(j,k)- and circular L(j,k)-labellings for the products of complete graphs"],"prefix":"10.1007","volume":"14","author":[{"given":"Peter Che Bor","family":"Lam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wensong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhuan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,5,3]]},"reference":[{"key":"9057_CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang GJ, Kuo D (1996) The L(2,1)-labelling problem on graphs. SIAM J Discret Math 9:309\u2013316","journal-title":"SIAM J Discret Math"},{"key":"9057_CR2","first-page":"141","volume":"109","author":"JP Georges","year":"1995","unstructured":"Georges JP, Mauro DW (1995) Generalized vertex labelings with a condition at distance two. Congr Numer 109:141\u2013159","journal-title":"Congr Numer"},{"key":"9057_CR3","first-page":"141","volume":"140","author":"JP Georges","year":"1999","unstructured":"Georges JP, Mauro DW (1999) Some results on \u03bb k j -numbers of the products of complete graphs. Congr Numer 140:141\u2013160","journal-title":"Congr Numer"},{"key":"9057_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0012-365X(02)00750-1","volume":"269","author":"JP Georges","year":"2003","unstructured":"Georges JP, Mauro DW (2003) Labeling trees with a condition at distance two. Discret Math 269:127\u2013148","journal-title":"Discret Math"},{"key":"9057_CR5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(93)E0098-O","volume":"135","author":"JP Georges","year":"1994","unstructured":"Georges JP, Mauro DW, Whittlesey MA (1994) Relating path coverings to vertex labellings with a condition at distance two. Discret Math 135:103\u2013111","journal-title":"Discret Math"},{"key":"9057_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/S0895480199351859","volume":"14","author":"JP Georges","year":"2000","unstructured":"Georges JP, Mauro DW, Stein MI (2000) 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":"9057_CR7","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discret Math 5:586\u2013595","journal-title":"SIAM J Discret Math"},{"key":"9057_CR8","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":"9057_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","year":"1998","unstructured":"Heuvel J, Leese RA, Shepherd MA (1998) Graph labeling and radio channel assignment. J Graph Theory 29:263\u2013283","journal-title":"J Graph Theory"},{"key":"9057_CR10","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1109\/81.886984","volume":"47","author":"PK Jha","year":"2000","unstructured":"Jha PK (2000) Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination. IEEE Trans Circuits Syst Fundam Theory Appl 47:1531\u20131534","journal-title":"IEEE Trans Circuits Syst Fundam Theory Appl"},{"key":"9057_CR11","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/81.917988","volume":"48","author":"PK Jha","year":"2001","unstructured":"Jha PK (2001) Optimal L(2,1)-labeling of strong products of cycles. IEEE Trans Circuits Syst Fundam Theory Appl 48:498\u2013500","journal-title":"IEEE Trans Circuits Syst Fundam Theory Appl"},{"key":"9057_CR12","first-page":"81","volume":"55","author":"PK Jha","year":"2000","unstructured":"Jha PK, Narayanan A, Sood P, Sundaram K, Sunder V (2000) On L(2,1)-labelling of the Cartesian product of a cycle and a path. Ars Comb 55:81\u201389","journal-title":"Ars Comb"},{"key":"9057_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0166-218X(02)00597-8","volume":"129","author":"S Klav\u017ear","year":"2003","unstructured":"Klav\u017ear S, Vesel A (2003) Computing invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers. Discret Appl Math 129:449\u2013460","journal-title":"Discret Appl Math"},{"key":"9057_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0012-365X(00)00299-5","volume":"232","author":"DDF Liu","year":"2001","unstructured":"Liu DDF (2001) Hamiltonicity and circular distance two labellings. Discret Math 232:163\u2013169","journal-title":"Discret Math"},{"key":"9057_CR15","first-page":"177","volume":"69","author":"DDF Liu","year":"2003","unstructured":"Liu DDF, Zhu X (2003) Circulant distance two labeling and circular chromatic number. Ars Comb 69:177\u2013183","journal-title":"Ars Comb"},{"key":"9057_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":"9057_CR17","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"MA Whittlesey","year":"1995","unstructured":"Whittlesey MA, Georges JP, Mauro DW (1995) On the \u03bb-number of Q n and related graphs. SIAM J Discret Math 8:499\u2013506","journal-title":"SIAM J Discret Math"},{"key":"9057_CR18","doi-asserted-by":"crossref","first-page":"397","DOI":"10.11650\/twjm\/1500407256","volume":"4","author":"K Wu","year":"2000","unstructured":"Wu K, Yeh RK (2000) Labelling graphs with the circular difference. Taiwan J Math 4:397\u2013405","journal-title":"Taiwan J Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9057-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9057-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9057-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:11Z","timestamp":1559276291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9057-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,3]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9057"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9057-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,3]]}}}