{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T05:42:23Z","timestamp":1791438143175,"version":"4.3.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s00373-008-0818-4","type":"journal-article","created":{"date-parts":[[2009,5,22]],"date-time":"2009-05-22T11:48:04Z","timestamp":1242992884000},"page":"27-34","source":"Crossref","is-referenced-by-count":3,"title":["The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes"],"prefix":"10.1007","volume":"25","author":[{"given":"An\u2013Hang","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jou\u2013Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yue\u2013Li","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,5,23]]},"reference":[{"key":"818_CR1","unstructured":"Brualdi, R.A., Li, Q.: The interchange graph of tournaments with the same score vector. In: Bondy, J.A., Murty, U.S.R., (eds.), Progress in Graph Theory. (Academic Press, Toronto, 1984) pp. 128\u2013151"},{"key":"818_CR2","unstructured":"Chartrand, G., Zhang, P.: Introduction to Graph Theory. McGraw-Hill, Boston (2005)"},{"key":"818_CR3","unstructured":"Gibson, P.M.: A bound for the number of tournaments with specified scores. J. Comb. Theory, Ser. B 36, 240\u2013243 (1984)"},{"key":"818_CR4","doi-asserted-by":"crossref","unstructured":"Harary, F., Moser, L.: The theory of round robin tournaments. Amer. Math. Monthly 73, 231\u2013246 (1966)","DOI":"10.1080\/00029890.1966.11970749"},{"key":"818_CR5","unstructured":"Kannan, R., Tetali, P., Vempala, S.: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms 14, 293\u2013308 (1999)"},{"key":"818_CR6","doi-asserted-by":"crossref","unstructured":"Landau H.G.: On dominance relations and the structure of animal societies, III: the condition for a score structure. Bull. Math. Biol. 15, 143\u2013148 (1953)","DOI":"10.1007\/BF02476378"},{"key":"818_CR7","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises, 2nd edition. North-Holland, Amsterdam, (1993)"},{"key":"818_CR8","doi-asserted-by":"crossref","unstructured":"McShine, L.: Random sampling of labeled tournaments. Electron. J. Comb. 7(1), #R8 (2000)","DOI":"10.37236\/1486"},{"key":"818_CR9","unstructured":"Moon, J. W.: Topics on Tournaments. Holt, Rinehart and Winston, New York (1968)"},{"key":"818_CR10","unstructured":"Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Trans. Comput. 37, 867\u2013872 (1988)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0818-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0818-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0818-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T16:41:01Z","timestamp":1589820061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0818-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["818"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0818-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}