Reconstruction of complete interval tournaments

MaRDI QIDQ3631212zbMATH OpenFDO

Authors Antal Iványi

Publication date 5 June 2009

Full work available at URL https://eudml.org/doc/227979

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Reconstruction of complete interval tournaments. II
• Score sets in multitournaments. I. Mathematical results
• Reconstruction of score sets
• scientific article; zbMATH DE number 1868915
• Tournaments associated with multigraphs and a theorem of Hakimi

Cited in

(7)

• On partial sorting in restricted rounds
• Reconstruction of score sets
• Recognition of split-graphic sequences
• Reconstruction of complete interval tournaments. II
• LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT
• Tournaments associated with multigraphs and a theorem of Hakimi
• On scores, losing scores and total scores in \(k\)-hypertournaments

This page was built for publication: Reconstruction of complete interval tournaments

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