{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:35Z","timestamp":1759063535828},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,19]],"date-time":"2014-10-19T00:00:00Z","timestamp":1413676800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10100-014-0365-4","type":"journal-article","created":{"date-parts":[[2014,10,18]],"date-time":"2014-10-18T07:29:18Z","timestamp":1413617358000},"page":"659-673","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["$$L(3,2,1)$$ L ( 3 , 2 , 1 ) -labeling of triangular and toroidal grids"],"prefix":"10.1007","volume":"23","author":[{"given":"Zehui","family":"Shao","sequence":"first","affiliation":[]},{"given":"Aleksander","family":"Vesel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,19]]},"reference":[{"key":"365_CR1","doi-asserted-by":"crossref","unstructured":"Barany M, Tuza Z (2014) Circular coloring of graphs via linear programming and tabu search. Cent Eur J Oper Res (to appear). doi: 10.1007\/s10100-014-0345-8","DOI":"10.1007\/s10100-014-0345-8"},{"key":"365_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"HL Bodlaender","year":"2004","unstructured":"Bodlaender HL, Kloks T, Tan RB, van Leeuwen J (2004) Approximations for $$\\lambda $$ \u03bb -coloring of graphs. Comput J 47:193\u2013204","journal-title":"Comput J"},{"key":"365_CR3","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.ipl.2013.03.003","volume":"113","author":"T Calamoneri","year":"2013","unstructured":"Calamoneri T (2013) Optimal $$L(\\delta _1, \\delta _2, 1)$$ L ( \u03b4 1 , \u03b4 2 , 1 ) -labeling of eight-regular grids. Inf Process Lett 113:361\u2013364","journal-title":"Inf Process Lett"},{"key":"365_CR4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s00186-008-0261-6","volume":"69","author":"T Calamoneri","year":"2009","unstructured":"Calamoneri T, Fusco EG, Tan RB, Vocca P (2009) $$L(h, 1, 1)$$ L ( h , 1 , 1 ) -labeling of outerplanar graphs. Math Methods Oper Res 69:307\u2013321","journal-title":"Math Methods Oper Res"},{"key":"365_CR5","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)$$ L ( 2 , 1 ) -labeling problem on graphs. SIAM J Discreat Math 9:309\u2013316","journal-title":"SIAM J Discreat Math"},{"key":"365_CR6","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.11650\/twjm\/1500406480","volume":"15","author":"M Chia","year":"2011","unstructured":"Chia M, Kuo D, Liao H, Yang C, Yeh RK (2011) $$L(3, 2, 1)$$ L ( 3 , 2 , 1 ) -labeling of graphs. Taiwan J Math 15:2439\u20132457","journal-title":"Taiwan J Math"},{"key":"365_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ejor.2008.01.028","volume":"195","author":"A Dupont","year":"2009","unstructured":"Dupont A, Linhares AC, Artigues C, Feillet D, Michelon P, Vasquez M (2009) The dynamic frequency assignment problem. Eur J Oper Res 195:75\u201388","journal-title":"Eur J Oper Res"},{"key":"365_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s10100-012-0276-1","volume":"21","author":"J Govor\u010din","year":"2013","unstructured":"Govor\u010din J, Gvozdenovi\u0107 N, Povh J (2013) New heuristics for the vertex coloring problem based on semidefinite programming. Cent Eur J Oper Res 21:13\u201325","journal-title":"Cent Eur J Oper Res"},{"key":"365_CR9","doi-asserted-by":"crossref","unstructured":"Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance two. SIAM J Discret Math 5:586\u2013595","DOI":"10.1137\/0405048"},{"key":"365_CR10","first-page":"497","volume":"681","author":"WK Hale","year":"1980","unstructured":"Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 681:497\u20131514","journal-title":"Proc IEEE"},{"key":"365_CR11","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of product graphs","author":"R Hammack","year":"2011","unstructured":"Hammack R, Imrich W, Klav\u017ear S (2011) Handbook of product graphs, 2nd edn. CRC Press, Boca Raton","edition":"2"},{"key":"365_CR12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.dam.2004.01.019","volume":"145","author":"PK Jha","year":"2005","unstructured":"Jha PK, Klav\u017ear S, Vesel A (2005) $$L(2, 1)$$ L ( 2 , 1 ) -labeling of direct product of paths and cycles. Discret Appl Math 145:317\u2013325","journal-title":"Discret Appl Math"},{"key":"365_CR13","first-page":"596","volume":"17","author":"L Jia-zhuang","year":"2004","unstructured":"Jia-zhuang L, Zhen-dong S (2004) The $$L(3, 2, 1)$$ L ( 3 , 2 , 1 ) -labeling problem on graphs. Math Appl 17:596\u2013602","journal-title":"Math Appl"},{"key":"365_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.11650\/tjm.17.2013.1909","volume":"17","author":"BM Kim","year":"2013","unstructured":"Kim BM, Song BC, Hwang W (2013) Distance three labellings for direct products of three complete graphs. Taiwan J Math 17:207\u2013219","journal-title":"Taiwan J Math"},{"key":"365_CR15","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1016\/j.ejc.2009.11.006","volume":"31","author":"D King","year":"2010","unstructured":"King D, Ras CJ, Zhou S (2010) The $$L(h, 1, 1)$$ L ( h , 1 , 1 ) -labelling problem for trees. Eur J Comb 31:1295\u20131306","journal-title":"Eur J Comb"},{"key":"365_CR16","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 graph 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":"365_CR17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.ipl.2005.01.007","volume":"94","author":"D Kor\u017ee","year":"2005","unstructured":"Kor\u017ee D, Vesel A (2005) $$L(2, 1)$$ L ( 2 , 1 ) -labeling of strong products of cycles. Inf Process Lett 94:183\u2013190","journal-title":"Inf Process Lett"},{"key":"365_CR18","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1049\/iet-com.2012.0568","volume":"7","author":"Z Shao","year":"2013","unstructured":"Shao Z, Vesel A (2013) Integer linear programming model and satisfiability test reduction for distance constrained labellings of graphs: the case of $$L(3, 2, 1)$$ L ( 3 , 2 , 1 ) labelling for products of paths and cycles. IET Commun 7:715\u2013720","journal-title":"IET Commun"},{"key":"365_CR19","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0377-2217(98)80006-4","volume":"107","author":"DH Smith","year":"1998","unstructured":"Smith DH, Hurley S, Thiel SU (1998) Improving heuristics for the frequency assignment problem. Eur J Oper Res 107:76\u201386","journal-title":"Eur J Oper Res"},{"key":"365_CR20","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":"365_CR21","unstructured":"Wheeler DA (2013) MiniSAT user guide: how to use the MiniSAT SAT solver. http:\/\/www.dwheeler.com\/essays\/minisat-user-guide.html . Accessed 9 Dec 2013"},{"key":"365_CR22","first-page":"135","volume":"6","author":"J \u017derovnik","year":"1998","unstructured":"\u017derovnik J (1998) On the convergence of a randomized algorithm frequency assignment problem. Cent Eur J Oper Res Econ 6:135\u2013151","journal-title":"Cent Eur J Oper Res Econ"},{"key":"365_CR23","doi-asserted-by":"crossref","first-page":"2846","DOI":"10.1016\/j.dam.2007.11.018","volume":"156","author":"S Zhou","year":"2008","unstructured":"Zhou S (2008) A distance labelling problem for hypercubes. Discret Appl Math 156:2846\u20132854","journal-title":"Discret Appl Math"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0365-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0365-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0365-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T05:45:33Z","timestamp":1565934333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0365-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,19]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["365"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0365-4","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,19]]}}}