Fair incomplete tournaments with odd number of teams and large number of games

MaRDI QIDQ5443192zbMATH OpenFDO

Authors Dalibor Fronček

Publication date 20 February 2008

zbMATH Keywords

magic labelingtournament scheduling

Mathematics Subject Classification ID

Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Fair incomplete tournaments
• A note on handicap incomplete tournaments
• Round-robin tournaments with homogeneous rounds
• Combinatorial properties of strength groups in round robin tournaments
• Designing fair 8- and 16-team knockout tournaments

Cited in

(12)

• On 14-regular distance magic graphs
• On regular distance magic graphs of odd order
• On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs
• On regular d-handicap tournaments
• Regular handicap graphs of order \(n \equiv 4 \pmod 8\)
• Fair incomplete tournaments
• On regular handicap graphs of order \(n \equiv 0\pmod 8\)
• A note on incomplete regular tournaments with handicap two of order \(n\equiv 8 \pmod{16}\)
• Magic and antimagic \(H\)-decompositions
• Quasimagic rectangles
• Regular handicap tournaments of high degree
• \((a,d)\)-distance antimagic labeling of some types of graphs

This page was built for publication: Fair incomplete tournaments with odd number of teams and large number of games

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