{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T04:35:55Z","timestamp":1711600555213},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0012-365x(03)00111-0","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T22:47:46Z","timestamp":1056149266000},"page":"277-288","source":"Crossref","is-referenced-by-count":4,"title":["On the identification problems in products of cycles"],"prefix":"10.1016","volume":"275","author":[{"given":"Petri","family":"Rosendahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00111-0_BIB1","series-title":"Cycles and Rays","first-page":"9","article-title":"Decomposition into cycles I: Hamilton decompositions","author":"Alspach","year":"1990"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(82)90163-7","article-title":"D\u00e9composition de la somme cart\u00e9sienne d'un cycle et de l'union de deux cycles Hamiltoniens en cycles Hamiltoniens","volume":"38","author":"Aubert","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00111-0_BIB3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/PL00001292","article-title":"Short dominating paths and cycles in the binary hypercube","volume":"5","author":"Blass","year":"2001","journal-title":"Ann. Combin."},{"key":"10.1016\/S0012-365X(03)00111-0_BIB4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S","article-title":"On binary codes for identification","volume":"8","author":"Blass","year":"2000","journal-title":"J. Combin. Des."},{"issue":"1\u20133","key":"10.1016\/S0012-365X(03)00111-0_BIB5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0012-365X(01)00113-3","article-title":"Bounds on identifying codes","volume":"241","author":"Blass","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00111-0_BIB6","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB7","series-title":"Fault Tolerant Parallel and Distributed Systems","first-page":"285","article-title":"Fault isolation and diagnosis in multiprocessor architectures with point-to-point connections","author":"Chakrabarty","year":"1998"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB8","doi-asserted-by":"crossref","unstructured":"I. Charon, O. Hudry, A. Lobstein, Identifying codes with small radius in some infinite regular graphs, Electron. J. Combin. 9, R11 (2002), 25 pp.","DOI":"10.37236\/1628"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB9","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","year":"1998"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB10","series-title":"Graph Symmetry: Algebraic Methods and Applications","first-page":"167","article-title":"Cayley graphs and interconnection networks","author":"Heydemann","year":"1997"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB11","series-title":"Proceedings of the AAECC-14","first-page":"308","article-title":"On the identification of vertices and edges using cycles","author":"Honkala","year":"2001"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB12","doi-asserted-by":"crossref","unstructured":"I. Honkala, M. Karpovsky, S. Litsyn, Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori, Discrete Appl. Math., accepted for publication.","DOI":"10.1016\/S0166-218X(02)00579-6"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB13","doi-asserted-by":"crossref","unstructured":"I. Honkala, T. Laihonen, On the identification of sets of points in the square lattice, Discrete Comput. Geom., to appear.","DOI":"10.1007\/s00454-002-0730-2"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB14","unstructured":"I. Honkala, T. Laihonen, Codes for identification in the king lattice, submitted."},{"key":"10.1016\/S0012-365X(03)00111-0_BIB15","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","article-title":"On a new class of codes for identifying vertices in graphs","volume":"44","author":"Karpovsky","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB16","unstructured":"A. Kotzig, Every cartesian product of two circuits is decomposable into two Hamiltonian Circuits, Centre de Reserches Mathematique, Montreal, 1973."},{"key":"10.1016\/S0012-365X(03)00111-0_BIB17","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1109\/18.986043","article-title":"Sequences of optimal identifying codes","volume":"48","author":"Laihonen","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB18","doi-asserted-by":"crossref","unstructured":"P. Rosendahl, On the identification of vertices using cycles, Electron. J. Combin. 10, R7 (2003), 11 pp.","DOI":"10.37236\/1700"},{"issue":"1\u20133","key":"10.1016\/S0012-365X(03)00111-0_BIB19","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(01)00244-8","article-title":"Fault-tolerant locating-dominating sets","volume":"249","author":"Slater","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00111-0_BIB20","doi-asserted-by":"crossref","unstructured":"L. Zakrevski, M. Karpovsky, Fault-tolerant message routing in computer networks, in: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, 1999, pp. 2279\u20132287.","DOI":"10.1007\/3-540-64359-1_737"},{"key":"10.1016\/S0012-365X(03)00111-0_BIB21","series-title":"Parallel and Distributed Processing","first-page":"714","article-title":"Fault-tolerant message routing for multiprocessors","author":"Zakrevski","year":"1998"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001110?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001110?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T13:05:51Z","timestamp":1682514351000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0012365X03001110"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00111-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}