Condition for a tournament score sequence to be simple

DOI10.1002/JGT.3190040204MaRDI QIDQ4187852zbMATH OpenOpenAlexFDO

Authors P. J. Avery

Publication date 1980

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190040204

zbMATH Keywords

EnumerationScore SequenceSimple Score SequenceTournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Cites work

• Computation of the Number of Score Sequences in Round-Robin Tournaments
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)

Cited in

(1)

• scientific article; zbMATH DE number 4016924 (Why is no real title available?)

This page was built for publication: Condition for a tournament score sequence to be simple

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