{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T15:14:37Z","timestamp":1785597277794,"version":"3.56.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T00:00:00Z","timestamp":1563840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T00:00:00Z","timestamp":1563840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00373-019-02062-x","type":"journal-article","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T05:53:04Z","timestamp":1563861184000},"page":"1139-1145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Note on Min\u2013Max Pair in Tournaments"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9602-379X","authenticated-orcid":false,"given":"Xiaoyun","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,7,23]]},"reference":[{"key":"2062_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.4153\/CMB-1967-028-6","volume":"10","author":"B Alspach","year":"1967","unstructured":"Alspach, B.: Cycles of each length in regular tournaments. Can. Math. Bull. 10, 283\u2013285 (1967)","journal-title":"Can. Math. Bull."},{"key":"2062_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0095-8956(74)90041-0","volume":"17","author":"B Alspach","year":"1974","unstructured":"Alspach, B., Reid, K.B., Roselle, D.P.: Bypasses in asymmetric digraphs. J. Comb. Theory Ser. B 17, 11\u201318 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2062_CR3","volume-title":"Digraphs Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2007","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs Theory, Algorithms and Applications. Springer, Berlin (2007)"},{"issue":"2","key":"2062_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/jgt.20018","volume":"47","author":"F Havet","year":"2004","unstructured":"Havet, F.: Pancyclic arcs and connectivity in tournaments. J. Graph Theory 47(2), 87\u2013110 (2004)","journal-title":"J. Graph Theory"},{"key":"2062_CR5","unstructured":"Jakobsen, O.S.: Cycles and paths in tournaments. Thesis, University of Aarhus (1972)"},{"key":"2062_CR6","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00373-018-1899-3","volume":"34","author":"X Lu","year":"2018","unstructured":"Lu, X.: On min\u2013max pair in tournaments. Graphs Comb. 34, 613\u2013618 (2018)","journal-title":"Graphs Comb."},{"key":"2062_CR7","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0095-8956(80)90061-1","volume":"28","author":"C Thomassen","year":"1980","unstructured":"Thomassen, C.: hamiltonian-connected tournaments. J. Comb. Theory Ser. B 28, 142\u2013163 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2062_CR8","first-page":"19","volume":"1","author":"F Tian","year":"1981","unstructured":"Tian, F., Zhang, C.-Q.: A note about the paths of each length in tournaments. J. Qufu Teach. Coll. 1, 19\u201321 (1981)","journal-title":"J. Qufu Teach. Coll."},{"key":"2062_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1002\/jgt.20110","volume":"50","author":"A Yeo","year":"2005","unstructured":"Yeo, A.: The number of pancyclic arcs in a k-strong tournament. J. Graph Theory 50, 212\u2013219 (2005)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02062-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02062-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02062-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:32:58Z","timestamp":1595374378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02062-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,23]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2062"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02062-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,23]]},"assertion":[{"value":"30 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}