{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T13:59:26Z","timestamp":1775483966329,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"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":9177,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0166-218x(88)90057-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"101-111","source":"Crossref","is-referenced-by-count":4,"title":["On common edges in optimal solutions to traveling salesman and other optimization problems"],"prefix":"10.1016","volume":"20","author":[{"given":"M.","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Poljak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90057-1_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/jgt.3190050313","article-title":"A census of maximum uniquely hamiltonian graphs","volume":"5","author":"Barefoot","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(88)90057-1_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(86)90063-4","article-title":"Parity results on connected f-factors","volume":"59","author":"Berman","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(88)90057-1_BIB3","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(88)90057-1_BIB4","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0166-218X(88)90057-1_BIB5","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1145\/22145.22193","article-title":"An algorithm for finding Hamilton cycles in a random graph","author":"Bollob\u00e1s","year":"1985","journal-title":"Proc. ACM STOC'85"},{"key":"10.1016\/0166-218X(88)90057-1_BIB6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/jgt.3190100113","article-title":"Parity theorems for paths and cycles in graphs","volume":"10","author":"Bondy","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(88)90057-1_BIB7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0095-8956(80)90087-8","article-title":"Spanning cycles of nearly cubic graphs","volume":"29","author":"Entringer","year":"1980","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/0166-218X(88)90057-1_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(88)90057-1_BIB9","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(88)90057-1_BIB10","unstructured":"A. Krawczyk, unpublished results."},{"key":"10.1016\/0166-218X(88)90057-1_BIB11","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(88)90057-1_BIB12","year":"1985"},{"key":"10.1016\/0166-218X(88)90057-1_BIB13","first-page":"337","article-title":"Extensions of k-subsets to k \u00f7 1-subsets - existence versus constructibility","volume":"23","author":"Poljak","year":"1982","journal-title":"Comm. Math. Univ. Carolinae"},{"key":"10.1016\/0166-218X(88)90057-1_BIB14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/jgt.3190010110","article-title":"Graphs with exactly one hamiltonian circuit","volume":"1","author":"Sheehan","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(88)90057-1_BIB15","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0166-218X(88)90057-1_BIB16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0167-5060(08)70511-9","article-title":"Hamiltonian cycles and uniquely edge colourable graphs","volume":"3","author":"Thomason","year":"1978","journal-title":"Advances in Graph Theory, Annals of Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900571?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900571?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:54:09Z","timestamp":1555134849000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88900571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0166218X88900571"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90057-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}