Construction of Hamilton path tournament designs
type: Item
instance of: scholarly article
title: Construction of Hamilton path tournament designs
zbMATH Open document ID: 1233.05074
author: Yoshiko T. Ikebe
author: Akihisa Tamura
published in: Graphs and Combinatorics
publication date: 2012-01-24T00:00:00Z
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 5999863
zbMATH Keywords: Balanced tournament design
zbMATH Keywords: Hamilton path
zbMATH Keywords: 1-Factor
MaRDI profile type: Publication
full work available at URL: s00373-010-0998-6
OpenAlex ID: W2062593963
cites work: Edge partitions of the complete symmetric directed graph and related designs
cites work: Decomposition of the complete directed graph into k-circuits
cites work: Some models of graphs for scheduling sports competitions
cites work: Construction of sports schedules with multiple venues
cites work: The construction of Kotzig factorizations
cites work: Q3819081
cites work: Self-orthogonal Hamilton path decompositions
cites work: On the existence of sports schedules with multiple venues
cites work: Balanced tournament designs and related topics
cites work: A constraint programming approach to the multiple-venue, sport-scheduling problem
cites work: Q4184851
cites work: Scheduling sports competitions on multiple venues.
DOI: 10.1007/S00373-010-0998-6
Recommended article: Q3819081
Recommended article: Q3218154
Recommended article: Q3680863
Recommended article: Q4519727
Recommended article: Finding an Oriented Hamiltonian Path in a Tournament
Recommended article: Constructing tournament designs
Recommended article: Q4527627
Recommended article: Antidirected Hamiltonian paths in tournaments
Recommended article: Hamiltonian paths and cycles in hypertournaments
Recommended article: The maximum number of Hamiltonian paths in tournaments
description: scientific article; zbMATH DE number 5999863