{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T21:04:14Z","timestamp":1772744654330,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,26]],"date-time":"2013-05-26T00:00:00Z","timestamp":1369526400000},"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-9632-x","type":"journal-article","created":{"date-parts":[[2013,5,25]],"date-time":"2013-05-25T01:46:37Z","timestamp":1369446397000},"page":"34-41","source":"Crossref","is-referenced-by-count":8,"title":["L( $$d$$ d ,1)-labelings of the edge-path-replacement by factorization of graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Nathaniel","family":"Karst","sequence":"first","affiliation":[]},{"given":"Jessica","family":"Oehrlein","sequence":"additional","affiliation":[]},{"given":"Denise Sakai","family":"Troxell","sequence":"additional","affiliation":[]},{"given":"Junjie","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,26]]},"reference":[{"key":"9632_CR1","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/j.dam.2011.10.021","volume":"160","author":"SS Adams","year":"2012","unstructured":"Adams SS, Booth P, Jaffe H, Zinnen SL (2012) Exact $$\\lambda $$ \u03bb -numbers of generalized Petersen graphs of certain higher orders and on M\u00f6bius strips. Discret Appl Math 160:436\u2013447","journal-title":"Discret Appl Math"},{"key":"9632_CR2","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: a survey and annotated bibliography. Comput J 54:1344\u20131371","journal-title":"Comput J"},{"key":"9632_CR3","doi-asserted-by":"crossref","first-page":"2655","DOI":"10.1016\/j.dam.2012.03.018","volume":"160","author":"MR Cerioli","year":"2012","unstructured":"Cerioli MR, Posner DFD (2012) On L(2,1)-coloring split, chordal bipartite and weakly chordal graphs. Discret Appl Math 160:2655\u20132661","journal-title":"Discret Appl Math"},{"key":"9632_CR4","doi-asserted-by":"crossref","unstructured":"Charpentier C, Montassier M, Raspauld A (2012) L(p, q)-labeling of sparse graphs. J Comb Optim. doi: 10.1007\/s10878-012-9507-6","DOI":"10.1007\/s10878-012-9507-6"},{"key":"9632_CR5","doi-asserted-by":"crossref","unstructured":"Chia ML, Kuo D, Yan JH, Yang SR (2012) (p, q)-total labeling of complete graphs. J Comb Optim. doi: 10.1007\/s10878-012-9471-1","DOI":"10.1007\/s10878-012-9471-1"},{"key":"9632_CR6","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 labelings with a condition at distance two. Discret Math 135:103\u2013111","journal-title":"Discret Math"},{"key":"9632_CR7","first-page":"141","volume":"109","author":"JP Georges","year":"1995","unstructured":"Georges JP, Mauro DW (1995) Generalized vertex labeling with a condition at distance two. Congr Numer 109:141\u2013159","journal-title":"Congr Numer"},{"key":"9632_CR8","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1016\/j.disc.2007.07.075","volume":"308","author":"D Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves D (2008) On the L(p,1)-labelling of graphs. Discret Math 308:1405\u20131414","journal-title":"Discret Math"},{"key":"9632_CR9","doi-asserted-by":"crossref","first-page":"585","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:585\u2013595","journal-title":"SIAM J Discret Math"},{"key":"9632_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1137\/090763998","volume":"26","author":"F Havet","year":"2012","unstructured":"Havet F, Reed B, Sereni JS- (2012) Griggs and Yeh\u2019s conjecture and L(p,1)-labelings. SIAM J Discret Math 26:145\u2013168","journal-title":"SIAM J Discret Math"},{"key":"9632_CR11","first-page":"498","volume":"308","author":"F Havet","year":"2008","unstructured":"Havet F, Yu ML (2008) (p, 1)-Total labeling of graphs. Discret Math 308:498\u2013513","journal-title":"Discret Math"},{"key":"9632_CR12","doi-asserted-by":"crossref","unstructured":"Lin W, Wu J (2012) Distance two edge labelings of lattices. J Comb Optim. doi: 10.1007\/s10878-012-9508-5","DOI":"10.1007\/s10878-012-9508-5"},{"key":"9632_CR13","doi-asserted-by":"crossref","unstructured":"L\u00fc D (2012) L(2,1)-labelings of the edge-path-replacement of a graph. J Comb Optim. doi: 10.1007\/s10878-012-9470-2","DOI":"10.1007\/s10878-012-9470-2"},{"key":"9632_CR14","doi-asserted-by":"crossref","unstructured":"L\u00fc D, Lin N (2012) L(d,1)-labelings of the edge-path-replacement of a graph. J Comb Optim. doi: 10.1007\/s10878-012-9487-6","DOI":"10.1007\/s10878-012-9487-6"},{"key":"9632_CR15","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.ipl.2012.04.003","volume":"112","author":"BS Panda","year":"2012","unstructured":"Panda BS, Goel P (2012) L(2, 1)-labeling of dually chordal graphs and strongly orderable graphs. Info Proc Lett 112:552\u2013556","journal-title":"Info Proc Lett"},{"key":"9632_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen J (1891) Die theorie der regularen graphen. Acta Math 15:193\u2013220","journal-title":"Acta Math"},{"key":"9632_CR17","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ipl.2011.11.005","volume":"112","author":"F Wang","year":"2012","unstructured":"Wang F, Lin W (2012) Group path covering and L(j, k)-labelings of diameter two graphs. Info Proc Lett 112:124\u2013128","journal-title":"Info Proc Lett"},{"key":"9632_CR18","doi-asserted-by":"crossref","unstructured":"Wu Q, Shiu WC, Sun PK (2012) Circular L(j, k)-labeling number of direct product of path and cycle. J Comb Optim. doi: 10.1007\/s10878-012-9520-9","DOI":"10.1007\/s10878-012-9520-9"},{"key":"9632_CR19","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":"9632_CR20","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10255-012-0151-9","volume":"28","author":"M Zhai","year":"2012","unstructured":"Zhai M, Lu C, Shu J (2012) A note on L(2, 1)-labelling of trees. Acta Mathematicae Applicatae Sinica 28:395\u2013400","journal-title":"Acta Mathematicae Applicatae Sinica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9632-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9632-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9632-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:21Z","timestamp":1559262201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9632-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,26]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9632"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9632-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,26]]}}}