{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:23:06Z","timestamp":1759666986066},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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":[[2003,9]]},"DOI":"10.1016\/s0012-365x(03)00041-4","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T22:25:53Z","timestamp":1048631153000},"page":"129-139","source":"Crossref","is-referenced-by-count":9,"title":["Weighted graphs with all Hamiltonian cycles of the same length"],"prefix":"10.1016","volume":"271","author":[{"given":"Santosh","family":"Kabadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00041-4_BIB1","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(86)90027-2","article-title":"Recognition of Gilmore\u2013Gomory traveling salesman problem","volume":"14","author":"Chandrasekaran","year":"1986","journal-title":"Dis. Appl. Math."},{"key":"10.1016\/S0012-365X(03)00041-4_BIB2","first-page":"128","article-title":"Constant discrete programming problems on substitution sets","volume":"5","author":"Gabovich","year":"1976","journal-title":"Kibernetika"},{"key":"10.1016\/S0012-365X(03)00041-4_BIB3","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","article-title":"Well solved special cases","author":"Gilmore","year":"1985"},{"key":"10.1016\/S0012-365X(03)00041-4_BIB4","series-title":"The Traveling Salesman Problem and its Variations","article-title":"Polynomially solvable cases of the traveling salesman problem","author":"Kabadi","year":"2002"},{"key":"10.1016\/S0012-365X(03)00041-4_BIB5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(94)90038-8","article-title":"Graphs in which all Hamiltonian cycles have the same length","volume":"55","author":"Krynski","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00041-4_BIB6","first-page":"1228","article-title":"Investigation of an algorithm for solving the travelling salesman problem","volume":"5","author":"Leont'ev","year":"1973","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"10.1016\/S0012-365X(03)00041-4_BIB7","unstructured":"V.I. Rublinetskii, Estimates of the accuracy of procedures in the travelling-salesman problem, Comput. Math. Comput. (Khar'kov) 4 (1973) 23 (in Russian)."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000414?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000414?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T12:59:36Z","timestamp":1553432376000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03000414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0012365X03000414"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00041-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}