Score sequences: Lexicographic enumeration and tournament construction

DOI10.1016/0012-365X(88)90203-8MaRDI QIDQ1115880zbMATH OpenOpenAlexFDO

Authors Severino V. Gervacio

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(88)90203-8

zbMATH Keywords

score sequencetournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Review text

The author describes procedures for (i) generating all tournament score sequences of a given length, and (ii) constructing a tournament with a given score sequence.

Cites work

• scientific article; zbMATH DE number 3657692 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• Score sequences: Lexicographic enumeration and tournament construction

Cited in

(6)

• Score sequences: Lexicographic enumeration and tournament construction
• Random generation of tournaments and asymmetric graphs with given out-degrees
• An algorithm to generate tournament score sequences
• Computing tournament sequence numbers efficiently with matrix techniques
• A random walk approach to linear statistics in random tournament ensembles
• Tournament Coding of Integer Sequences

This page was built for publication: Score sequences: Lexicographic enumeration and tournament construction

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