{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T20:25:17Z","timestamp":1664655917619},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,9]],"date-time":"2013-04-09T00:00:00Z","timestamp":1365465600000},"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,4]]},"DOI":"10.1007\/s10878-013-9615-y","type":"journal-article","created":{"date-parts":[[2013,4,8]],"date-time":"2013-04-08T05:33:35Z","timestamp":1365399215000},"page":"655-669","source":"Crossref","is-referenced-by-count":8,"title":["On $$(s,t)$$ ( s , t ) -relaxed $$L(2,1)$$ L ( 2 , 1 ) -labelings of the triangular lattice"],"prefix":"10.1007","volume":"29","author":[{"given":"Wensong","family":"Lin","sequence":"first","affiliation":[]},{"given":"Benqiu","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,9]]},"reference":[{"key":"9615_CR1","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 (2004) $$L(h,1)$$ L ( h , 1 ) -labeling subclasses of planar graphs. J Parallel Distrib Comput 64:414\u2013426","journal-title":"J Parallel Distrib Comput"},{"key":"9615_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.46298\/dmtcs.361","volume":"8","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T (2006) Optimal $$L(h, k)$$ L ( h , k ) -labeling of regular grids. Discret Math Theor Comput Sci 8:141\u2013158","journal-title":"Discret Math Theor Comput Sci"},{"issue":"2","key":"9615_CR3","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1504\/IJMNDI.2006.010811","volume":"1","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T, Caminiti S, Fertin G (2006) New bounds for the $$L(h, k)$$ L ( h , k ) -number of regular grids. Int J Mob Netw Des Innov 1(2):92\u2013101","journal-title":"Int J Mob Netw Des Innov"},{"issue":"8","key":"9615_CR4","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)-labeling problem: an updated survey and annotated bibliography. Comput J 54(8):1344\u20131371","journal-title":"Comput J"},{"key":"9615_CR5","unstructured":"Dai B, Lin W (2012a) On $$(s, t)$$ ( s , t ) -relaxed $$L(2,1)$$ L ( 2 , 1 ) -labelings of the hexagonal lattice (under review)"},{"key":"9615_CR6","unstructured":"Dai B, Lin W (2012b) On $$(s, t)$$ ( s , t ) -relaxed $$L(2,1)$$ L ( 2 , 1 ) -labelings of the square lattice (under review)"},{"key":"9615_CR7","first-page":"369","volume":"21","author":"J Goodwin","year":"2000","unstructured":"Goodwin J, Johnston D, Marcus A (2000) Radio channel assignments. UMAP J 21:369\u2013378","journal-title":"UMAP J"},{"key":"9615_CR8","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 2. SIAM J Discret Math 5:586\u2013595","journal-title":"SIAM J Discret Math"},{"issue":"2\u20133","key":"9615_CR9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10878-007-9055-7","volume":"14","author":"JR Griggs","year":"2007","unstructured":"Griggs JR, Jin XT (2007) Recent progress in mathematics and engineering on optimal graph labelings with distance conditions. J Combin Optim 14(2\u20133):249\u2013257","journal-title":"J Combin Optim"},{"issue":"3","key":"9615_CR10","doi-asserted-by":"crossref","first-page":"996C1021","DOI":"10.1137\/060650982","volume":"22","author":"JR Griggs","year":"2008","unstructured":"Griggs JR, Jin XT (2008) Real number channel assignments for lattices. SIAM J Discret Math 22(3):996C1021","journal-title":"SIAM J Discret Math"},{"key":"9615_CR11","unstructured":"Lin W (2012) On relaxed $$L(2,1)$$ L ( 2 , 1 ) -labeling of graphs. Manuscript"},{"issue":"6","key":"9615_CR12","doi-asserted-by":"crossref","first-page":"2063","DOI":"10.11650\/twjm\/1500406839","volume":"16","author":"W Lin","year":"2012","unstructured":"Lin W, Wu J (2012) On circular- $$L(2,1)$$ L ( 2 , 1 ) -edge-labeling of graphs. Taiwan J Math 16(6):2063\u20132075","journal-title":"Taiwan J Math"},{"key":"9615_CR13","author":"W Lin","year":"2012","unstructured":"Lin W, Wu J (2012) Distance two edge labelings of lattices. J. Combin. Optim. doi: 10.1007\/s10878-012-9508-5","journal-title":"J. Combin. Optim."},{"issue":"16\u201317","key":"9615_CR14","doi-asserted-by":"crossref","first-page":"2452","DOI":"10.1016\/j.dam.2012.06.005","volume":"160","author":"W Lin","year":"2012","unstructured":"Lin W, Zhang P (2012) On n-fold $$L(j, k)$$ L ( j , k ) - and circular $$L(j, k)$$ L ( j , k ) -labeling of graphs. Discret Appl Math 160(16\u201317):2452\u20132461","journal-title":"Discret Appl Math"},{"key":"9615_CR15","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":"van den 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":"9615_CR16","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 at distance two. Discret Math 306:1217\u20131231","journal-title":"Discret Math"},{"key":"9615_CR17","author":"P Zhang","year":"2012","unstructured":"Zhang P, Lin W (2012) Multiple $$L(j,1)$$ L ( j , 1 ) -labeling of the triangular lattice, to appear in. J. Combin. Optim. doi: 10.1007\/s10878-012-9549-9","journal-title":"J. Combin. Optim."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9615-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9615-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9615-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,13]],"date-time":"2022-02-13T07:16:59Z","timestamp":1644736619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9615-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9615"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9615-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,9]]}}}