Minimizing irregularities in sports schedules using graph theory

@article{Werra1982MinimizingII,
  title={Minimizing irregularities in sports schedules using graph theory},
  author={Dominique de Werra},
  journal={Discrete Applied Mathematics},
  year={1982},
  volume={4},
  pages={217-226}
}
The purpose of this paper is to study some combinatorial problems which occur in scheduling the games of a sports league. We will consider a league of 2n teams which have to play once against each other. A game between team i and team j is a home-game (H) for either team i or team j; it is an away-game (A) for the other team. One represents the league by a complete graph Kzn on 2n nodes: each team is associated with a node and a game between team i and j is an edge [i,j]. A l-factorization (F… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…