{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:38Z","timestamp":1720640858385},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80125-8","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"60-63","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Slater orders and Hamiltonian paths of tournaments"],"prefix":"10.1016","volume":"5","author":[{"given":"Ir\u00e8ne","family":"Charon","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Hudry","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80125-8_BIB1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02128667","article-title":"The maximum number of Hamiltonian paths in tournaments","volume":"10","author":"Alon","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(05)80125-8_BIB2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(94)00042-C","article-title":"The reversing number of a digraph","volume":"60","author":"Barth\u00e9lemy","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1571-0653(05)80125-8_BIB3","series-title":"Topics on tournaments","author":"Moon","year":"1968"},{"key":"10.1016\/S1571-0653(05)80125-8_BIB4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1093\/biomet\/53.1-2.143","article-title":"Maximum likelihood paired comparison rankings","volume":"53","author":"Remage","year":"1966","journal-title":"Biometrika"},{"key":"10.1016\/S1571-0653(05)80125-8_BIB5","series-title":"Matrices of zeros and ones in combinatorial mathematics, in Recent Advances in Matrix Theory","first-page":"103","author":"Ryser","year":"1964"},{"key":"10.1016\/S1571-0653(05)80125-8_BIB6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1093\/biomet\/48.3-4.303","article-title":"Inconsistencies in a schedule of paired comparison rankings","volume":"48","author":"Slater","year":"1961","journal-title":"Biometrika"},{"key":"10.1016\/S1571-0653(05)80125-8_BIB7","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TCT.1963.1082116","article-title":"Minimum feedback arc sets for a directed graph","volume":"10","author":"Younger","year":"1963","journal-title":"IEEE Trans. Circuit Theory"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801258?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801258?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:57:37Z","timestamp":1548532657000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":7,"alternative-id":["S1571065305801258"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80125-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}