{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:14:46Z","timestamp":1774437286256,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3886,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0195-6698(02)00134-8","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T16:26:05Z","timestamp":1044375965000},"page":"53-58","source":"Crossref","is-referenced-by-count":26,"title":["Distance-two labelings of graphs"],"prefix":"10.1016","volume":"24","author":[{"given":"Gerard J.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changhong","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(02)00134-8_B1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0012-365X(99)00400-8","article-title":"On L(d,1)-labelings of graphs","volume":"220","author":"Chang","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0195-6698(02)00134-8_B2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","article-title":"The L(2,1)-labeling on graphs","volume":"9","author":"Chang","year":"1996","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0195-6698(02)00134-8_B3","unstructured":"G.J. Chang, S.-C. Liaw, The L(2,1)-labeling problem on ditrees, Ars Combin. (accepted)"},{"key":"10.1016\/S0195-6698(02)00134-8_B4","first-page":"33","article-title":"On the criticality of graphs labeled with a condition at distance two","volume":"101","author":"Georges","year":"1994","journal-title":"Congr. Numer."},{"key":"10.1016\/S0195-6698(02)00134-8_B5","first-page":"141","article-title":"Generalized vertex labelings with a condition at distance two","volume":"109","author":"Georges","year":"1995","journal-title":"Congr. Numer."},{"key":"10.1016\/S0195-6698(02)00134-8_B6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<47::AID-JGT7>3.0.CO;2-L","article-title":"On the size of graphs labeled with a condition at distance two","volume":"22","author":"Georges","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0195-6698(02)00134-8_B7","first-page":"141","article-title":"Some results on \u03bbkj-numbers of the products of complete graphs","volume":"140","author":"Georges","year":"1999","journal-title":"Congr. Numer."},{"key":"10.1016\/S0195-6698(02)00134-8_B8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(93)E0098-O","article-title":"Relating path covering to vertex labelings with a condition at distance two","volume":"135","author":"Georges","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0195-6698(02)00134-8_B9","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","article-title":"Labeling graphs with a condition at distance two","volume":"5","author":"Griggs","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0195-6698(02)00134-8_B10","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0195-6698(02)00134-8_B11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","article-title":"Graph labeling and radio channel assignment","volume":"29","author":"van den Heuvel","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0195-6698(02)00134-8_B12","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1109\/81.886984","article-title":"Optimal L(2,1)-labeling of Cartesian products of cycles with an application to independent domination","volume":"47","author":"Jha","year":"2000","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"10.1016\/S0195-6698(02)00134-8_B13","first-page":"81","article-title":"On L(2,1)-labeling of the Cartesian product of a cycle and a path","volume":"55","author":"Jha","year":"2000","journal-title":"Ars Combin."},{"key":"10.1016\/S0195-6698(02)00134-8_B14","first-page":"13","article-title":"On distance-two labelings of graphs","volume":"47","author":"Liu","year":"1997","journal-title":"Ars Combin."},{"key":"10.1016\/S0195-6698(02)00134-8_B15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.11650\/twjm\/1500407157","article-title":"Aspects of structural combinatorics (graph homomorphisms and their use)","volume":"3","author":"Nes\u0306etr\u0306il","year":"1999","journal-title":"Taiwanese J. Math."},{"key":"10.1016\/S0195-6698(02)00134-8_B16","unstructured":"F.S. Roberts, Private communication through J. Griggs (1988)"},{"key":"10.1016\/S0195-6698(02)00134-8_B17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480191223178","article-title":"Labeling chordal graphs with a condition at distance two","volume":"7","author":"Sakai","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0195-6698(02)00134-8_B18","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480192242821","article-title":"On the \u03bb-number of Qn and related graphs","volume":"8","author":"Whittlesey","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0195-6698(02)00134-8_B19","doi-asserted-by":"crossref","first-page":"397","DOI":"10.11650\/twjm\/1500407256","article-title":"Labeling graphs with the circular difference","volume":"4","author":"Wu","year":"2000","journal-title":"Taiwanese J. Math."},{"key":"10.1016\/S0195-6698(02)00134-8_B20","doi-asserted-by":"crossref","first-page":"675","DOI":"10.11650\/twjm\/1500407301","article-title":"The edge span of distance two labelings of graphs","volume":"4","author":"Yeh","year":"2000","journal-title":"Taiwanese J. Math."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669802001348?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669802001348?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T22:30:32Z","timestamp":1553898632000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669802001348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0195669802001348"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(02)00134-8","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}