A characterization of unique tournaments
The author uses results of \textit{V. Müller}, \textit{J. Nešetřil} and \textit{J. Pelant} [Discrete Math. 11, 37-66 (1975; Zbl 0301.05114)] to deduce that there are exactly four strong tournaments that are determined up to isomorphism by their score sequences. Reviewer's remark: A direct proof of this result was given by \textit{P. Avery} [J. Graph Theory 4, 157-164 (1980; Zbl 0403.05045)].
scientific article; zbMATH DE number 1154568