Covering relations, closest orderings and Hamiltonian bypaths in tournaments
DOI10.1007/BF00183046zbMATH Open0734.90027OpenAlexW2050887669MaRDI QIDQ811322FDOQ811322
Authors: Jeffrey S. Banks, Georges Bordes, Michel Le Breton 
Publication date: 1991
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00183046
Recommendations
- Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
- scientific article; zbMATH DE number 2114688
- On the maximum number of Hamiltonian paths in tournaments
- Solution of a covering problem related to labelled tournaments
- On the path covering number of given subdigraphs of regular multipartite tournaments
- scientific article; zbMATH DE number 3902692
- scientific article; zbMATH DE number 1539540
- About the number of oriented Hamiltonian paths and cycles in tournaments
Social choice (91B14) Directed graphs (digraphs), tournaments (05C20) Mathematical economics (91B99) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (6)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Weak covering relations
- A survey on the linear ordering problem for weighted or unweighted tournaments
- The Copeland measure of Condorcet choice functions
- New results on the computation of median orders
- Condorcet choice correspondences: A set-theoretical comparison
This page was built for publication: Covering relations, closest orderings and Hamiltonian bypaths in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811322)
