Construction of Hamilton path tournament designs
From MaRDI portal
Publication:659734
DOI10.1007/S00373-010-0998-6zbMATH Open1233.05074OpenAlexW2062593963MaRDI QIDQ659734FDOQ659734
Authors: Yoshiko T. Ikebe, Akihisa Tamura 
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
Recommendations
- scientific article; zbMATH DE number 4091522
- scientific article; zbMATH DE number 3884197
- scientific article; zbMATH DE number 3902692
- scientific article; zbMATH DE number 1539540
- Finding an Oriented Hamiltonian Path in a Tournament
- Constructing tournament designs
- scientific article; zbMATH DE number 1560971
- Antidirected Hamiltonian paths in tournaments
- Hamiltonian paths and cycles in hypertournaments
- The maximum number of Hamiltonian paths in tournaments
Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Other designs, configurations (05B30)
Cites Work
- Some models of graphs for scheduling sports competitions
- Construction of sports schedules with multiple venues
- A constraint programming approach to the multiple-venue, sport-scheduling problem
- Title not available (Why is that?)
- Decomposition of the complete directed graph into k-circuits
- The construction of Kotzig factorizations
- Title not available (Why is that?)
- Edge partitions of the complete symmetric directed graph and related designs
- Self-orthogonal Hamilton path decompositions
- Scheduling sports competitions on multiple venues.
- Balanced tournament designs and related topics
- On the existence of sports schedules with multiple venues
Cited In (2)
This page was built for publication: Construction of Hamilton path tournament designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659734)
