Construction of Hamilton path tournament designs

DOI10.1007/s00373-010-0998-6zbMath1233.05074OpenAlexW2062593963MaRDI QIDQ659734

Akihisa Tamura, Yoshiko T. Ikebe

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0998-6

zbMATH Keywords

Hamilton path1-FactorBalanced tournament design

Mathematics Subject Classification ID

Other designs, configurations (05B30) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On the existence of sports schedules with multiple venues
• Some models of graphs for scheduling sports competitions
• Edge partitions of the complete symmetric directed graph and related designs
• Self-orthogonal Hamilton path decompositions
• Decomposition of the complete directed graph into k-circuits
• Scheduling sports competitions on multiple venues.
• Balanced tournament designs and related topics
• The construction of Kotzig factorizations
• Construction of sports schedules with multiple venues
• A constraint programming approach to the multiple-venue, sport-scheduling problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of Hamilton path tournament designs