Deciding soccer scores and partial orientations of graphs

MaRDI QIDQ3629757zbMATH OpenFDO

Authors Dömötör Pálvölgyi

Publication date 2 June 2009

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

zbMATH Keywords

partial orientationsoccer tournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Soccer is Harder Than Football
• Tournament scoring problem
• Deciding football sequences
• The new FIFA rules are hard: Complexity aspects of sports competitions.
• Tournaments, oriented graphs and football sequences

Cited in

(6)

• Online and quasi-online colorings of wedges and intervals
• Deciding football sequences
• Octants are cover-decomposable
• The new FIFA rules are hard: Complexity aspects of sports competitions.
• Convex polygons are self-coverable
• Score calculation from final tournament tables

This page was built for publication: Deciding soccer scores and partial orientations of graphs

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