Published October 1991
| public
Journal Article
Covering relations, closest orderings and hamiltonian bypaths in tournaments
Chicago
An error occurred while generating the citation.
Abstract
We show that the Slater's set of a tournament, i.e. the set of the top elements of the closest orderings, is a subset of the top cycle of the uncovered set of the tournament. We also show that the covering relation is related to the hamiltonian bypaths of a strong tournament in that if x covers y, then there exists an hamiltonian bypath from x to y.
Additional Information
© 1991 Springer-Verlag. Received October 22, 1990. Accepted April 2, 1991. We thank B. Monjardet and an anonymous editor for helpful suggestions.Additional details
- Eprint ID
- 67351
- Resolver ID
- CaltechAUTHORS:20160525-130230346
- Created
-
2016-05-26Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field