Construction of Hamilton path tournament designs

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1007/S00373-010-0998-6" rel="nofollow">DOI 10.1007/S00373-010-0998-6</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1233.05074" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W2062593963" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q659734" rel="nofollow">MaRDI QID Q659734</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q659734" rel="nofollow">FDO</a>

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

zbMATH Keywords

Hamilton path1-FactorBalanced tournament design

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4091522 (Why is no real title available?)
• scientific article; zbMATH DE number 3621745 (Why is no real title available?)
• A constraint programming approach to the multiple-venue, sport-scheduling problem
• Balanced tournament designs and related topics
• Construction of sports schedules with multiple venues
• Decomposition of the complete directed graph into k-circuits
• Edge partitions of the complete symmetric directed graph and related designs
• On the existence of sports schedules with multiple venues
• Scheduling sports competitions on multiple venues.
• Self-orthogonal Hamilton path decompositions
• Some models of graphs for scheduling sports competitions
• The construction of Kotzig factorizations

Cited in

(2)

• scientific article; zbMATH DE number 3914351 (Why is no real title available?)
• scientific article; zbMATH DE number 4091522 (Why is no real title available?)

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)