{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T13:27:52Z","timestamp":1690810072491},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,5,26]],"date-time":"2012-05-26T00:00:00Z","timestamp":1337990400000},"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":[[2013,5]]},"DOI":"10.1007\/s10878-012-9508-5","type":"journal-article","created":{"date-parts":[[2012,5,25]],"date-time":"2012-05-25T09:03:16Z","timestamp":1337936596000},"page":"661-679","source":"Crossref","is-referenced-by-count":9,"title":["Distance two edge labelings of lattices"],"prefix":"10.1007","volume":"25","author":[{"given":"Wensong","family":"Lin","sequence":"first","affiliation":[]},{"given":"Jianzhuan","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,26]]},"reference":[{"key":"9508_CR1","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(92)90678-9","volume":"108","author":"LD Andersen","year":"1992","unstructured":"Andersen LD (1992) The strong chromatic index of a cubic graph is at most 10. Discrete Math 108:231\u2013252","journal-title":"Discrete Math"},{"issue":"5","key":"9508_CR2","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T (2006) The L(h,k)-labelling problem: a survey and annotated bibliography. Comput J 49(5):585\u2013608","journal-title":"Comput J"},{"key":"9508_CR3","doi-asserted-by":"crossref","first-page":"1468","DOI":"10.1016\/j.disc.2012.01.014","volume":"312","author":"GJ Chang","year":"2012","unstructured":"Chang GJ, Liu DD-F (2012) Strong edge-coloring for cubic Halin graphs. Discrete Math 312:1468\u20131475","journal-title":"Discrete Math"},{"key":"9508_CR4","doi-asserted-by":"crossref","first-page":"1896","DOI":"10.1016\/j.dam.2009.01.001","volume":"157","author":"GJ Chang","year":"2009","unstructured":"Chang GJ, Lu C, Zhou S (2009) Distance-two labellings of Hamming graphs. Discrete Appl Math 157:1896\u20131904","journal-title":"Discrete Appl Math"},{"key":"9508_CR5","unstructured":"Chen Q, Lin W (2007) L(j,k)-labelings and L(j,k)-edge-labelings of graphs. Ars Comb (to appear)"},{"key":"9508_CR6","doi-asserted-by":"crossref","first-page":"2772","DOI":"10.1016\/j.disc.2006.03.053","volume":"306","author":"D Cranston","year":"2006","unstructured":"Cranston D (2006) Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discrete Math 306:2772\u20132778","journal-title":"Discrete Math"},{"key":"9508_CR7","first-page":"205","volume":"29B","author":"RJ Faudree","year":"1990","unstructured":"Faudree RJ, Schelp RH, Gy\u00e1rf\u00e1s A, Tuza Zs (1990) The strong chromatic index of graphs. Ars Comb 29B:205\u2013211","journal-title":"Ars Comb"},{"key":"9508_CR8","first-page":"109","volume":"70","author":"JP Georges","year":"2004","unstructured":"Georges JP, Mauro DW (2004) Edge labelings with a condition at distance two. Ars Comb 70:109\u2013128","journal-title":"Ars Comb"},{"issue":"2\u20133","key":"9508_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 labellings with distance conditions. J Comb Optim 14 (2\u20133):249\u2013257","journal-title":"J Comb Optim"},{"key":"9508_CR10","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JP Griggs","year":"1992","unstructured":"Griggs JP, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discrete Math 5:586\u2013595","journal-title":"SIAM J Discrete Math"},{"key":"9508_CR11","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":"9508_CR12","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":"9508_CR13","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)- and circular L(j,k)-labellings for the products of complete graphs. J Comb Optim 14:219\u2013227","journal-title":"J Comb Optim"},{"key":"9508_CR14","doi-asserted-by":"crossref","first-page":"\u266fR16","DOI":"10.37236\/1769","volume":"11","author":"RA Leese","year":"2004","unstructured":"Leese RA, Noble SD (2004) Cyclic labellings with constraints at two distance. Electron J Comb 11:\u266fR16","journal-title":"Electron J Comb"},{"key":"9508_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0012-365X(00)00299-5","volume":"232","author":"DD-F Liu","year":"2001","unstructured":"Liu DD-F (2001) Hamiltonicity and circular distance two labellings. Discrete Math 232:163\u2013169","journal-title":"Discrete Math"},{"key":"9508_CR16","first-page":"177","volume":"69","author":"DD-F Liu","year":"2003","unstructured":"Liu DD-F, Zhu X (2003) Circulant distant two labeling and circular chromatic number. Ars Comb 69:177\u2013183","journal-title":"Ars Comb"},{"issue":"1","key":"9508_CR17","first-page":"91","volume":"29","author":"D L\u00fc","year":"2009","unstructured":"L\u00fc D, Lin W, Song Z (2009) L(2,1)-circular labelings of Cartesian products of complete graphs. J Math Res Expo 29(1):91\u201398","journal-title":"J Math Res Expo"},{"key":"9508_CR18","unstructured":"Sun X (2007) The bounds for distance two edge labeling numbers of graphs. Master thesis, Southest University"},{"key":"9508_CR19","doi-asserted-by":"crossref","first-page":"6254","DOI":"10.1016\/j.disc.2007.11.051","volume":"308","author":"J Wu","year":"2008","unstructured":"Wu J, Lin W (2008) The strong chromatic index of a class of graphs. Discrete Math 308:6254\u20136261","journal-title":"Discrete Math"},{"key":"9508_CR20","doi-asserted-by":"crossref","first-page":"397","DOI":"10.11650\/twjm\/1500407256","volume":"4","author":"K-F Wu","year":"2000","unstructured":"Wu K-F, Yeh RK (2000) Labelling graphs with the circular difference. Taiwan J Math 4:397\u2013405","journal-title":"Taiwan J Math"},{"key":"9508_CR21","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. Discrete Math 306:1217\u20131231","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9508-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9508-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9508-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T02:58:57Z","timestamp":1594177137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9508-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,26]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9508"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9508-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,26]]}}}