A characterization of unique tournaments

DOI10.1006/JCTB.1997.1799MaRDI QIDQ1386429zbMATH OpenOpenAlexFDO

Authors Prasad Tetali

Publication date 26 November 1998

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1997.1799

zbMATH Keywords

score sequencestournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)

Review text

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)].

Cites work

• Either tournaments or algebras?
• scientific article; zbMATH DE number 3675933 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• On enumerating tournaments that admit exactly one Hamiltonian circuit
• Tournaments That Admit Exactly One Hamiltonian Circuit

Cited in

(2)

• Coevolutionary systems and PageRank
• The watchman's walk problem on directed graphs

This page was built for publication: A characterization of unique tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386429)