{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:21Z","timestamp":1720640841212},"reference-count":6,"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)80153-2","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T07:08:52Z","timestamp":1114931332000},"page":"166-169","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Trees in tournaments"],"prefix":"10.1016","volume":"5","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80153-2_BIB1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01206356","article-title":"Trees in tournaments","volume":"11","author":"H\u00e4ggkvist","year":"1991","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(05)80153-2_BIB2","unstructured":"proved g(3) \u2264 5. A tree is constructive, if every path from a node to another node is not directed with first and last block (maximal directed subpath) of length at least two and every path from node to a leaf has first block of length at least two. In this paper, we prove that Havet and Thomass\u00e9's conjecture is true for constructible trees."},{"key":"10.1016\/S1571-0653(05)80153-2_BIB3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1006\/jctb.1999.1945","article-title":"Oriented hamiltonian paths in tournaments: a proof of Rosenfeld's conjecture","volume":"78","author":"Havet","year":"2000","journal-title":"J. Combinatorial Theory Ser. B."},{"key":"10.1016\/S1571-0653(05)80153-2_BIB4","author":"Havet","year":"1999","journal-title":"Median order: a tool for the second neighborhood problem and Sumner's conjecture. Manuscript"},{"key":"10.1016\/S1571-0653(05)80153-2_BIB5","first-page":"377","article-title":"Embedding oriented n-trees in tournaments","volume":"18","author":"Reid","year":"1983","journal-title":"Studio, Sci. Math. Hungaria"},{"key":"10.1016\/S1571-0653(05)80153-2_BIB6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/S0002-9947-1986-0837805-6","article-title":"Paths and cycles in tournaments","volume":"296","author":"Thomason","year":"1986","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801532?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801532?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T14:58:01Z","timestamp":1548514681000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":6,"alternative-id":["S1571065305801532"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80153-2","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}