{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T08:15:43Z","timestamp":1710404143222},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00230-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"47-58","source":"Crossref","is-referenced-by-count":12,"title":["Characterizing bipartite Toeplitz graphs"],"prefix":"10.1016","volume":"263","author":[{"given":"Reinhardt","family":"Euler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00230-9_BIB1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and their connectivities","volume":"8","author":"Boesch","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(00)00230-9_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0166-218X(91)90024-Q","article-title":"Efficiently solvable special cases of bottleneck traveling salesman problems","volume":"32","author":"Burkard","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00230-9_BIB3","unstructured":"R. Euler, Coloring infinite, planar toeplitz graphs, Tech. Report, Laboratoire d'Informatique de Brest (LIBr), November 1998."},{"key":"10.1016\/S0304-3975(00)00230-9_BIB4","first-page":"119","article-title":"A characterization of infinite, bipartite toeplitz graphs","volume":"vol. 1","author":"Euler","year":"1995"},{"key":"10.1016\/S0304-3975(00)00230-9_BIB5","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(00)00230-9_BIB6","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.25.5.741","article-title":"Minimizing wallpaper waste, part 1","volume":"25","author":"Garfinkel","year":"1977","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(00)00230-9_BIB7","unstructured":"E.A. Medova-Dempster, The circulant traveling salesman problem, Tech. Report, University of Pisa, 1988."},{"key":"10.1016\/S0304-3975(00)00230-9_BIB8","unstructured":"E. van Daal, G. Tijssen, J.A.A. van der Veen, Ch. Zamfirescu, T. Zamfirescu, Hamiltonian properties of toeplitz graphs, Tech. Report, University of Dortmund, 1993."},{"key":"10.1016\/S0304-3975(00)00230-9_BIB9","unstructured":"J.A.A. van der Veen, R. van Dal, G. Sierksma, The symmetric circulant traveling salesman problem, Tech. Rep. 429, University of Groningen, 1991."},{"key":"10.1016\/S0304-3975(00)00230-9_BIB10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/jgt.3190100103","article-title":"Connectivity of circulant digraphs","volume":"10","author":"van Doorn","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(00)00230-9_BIB11","unstructured":"Q.F. Yang, R.E. Burkard, E. Cela, G.J. Woeginger, Hamiltonian cycles in circulant digraphs with two stripes, Tech. Report 20, Technical University Graz, March 1995."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002309?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002309?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:21:38Z","timestamp":1556792498000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002309"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00230-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}