Pages that link to "Item:Q5518145"
From MaRDI portal
The following pages link to The Theory of Round Robin Tournaments (Q5518145):
Displayed 50 items.
- Universal arcs in tournaments (Q284728) (← links)
- \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs (Q385956) (← links)
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs (Q394200) (← links)
- On linear programming duality and Landau's characterization of tournament (Q399504) (← links)
- A heuristic method to rectify intransitive judgments in pairwise comparison matrices (Q421772) (← links)
- Digraphs that have at most one walk of a given length with the same endpoints (Q616364) (← links)
- On incentive compatible competitive selection protocols (Q639276) (← links)
- Circuits of each length in tournaments (Q742644) (← links)
- Generalized intransitive dice. II: Partition constructions (Q825253) (← links)
- Weakly quasi-Hamiltonian-connected multipartite tournaments (Q898116) (← links)
- The selection efficiency of tournaments (Q976506) (← links)
- On arc-traceable local tournaments (Q998389) (← links)
- The interchange graphs of tournaments with minimum score vectors are exactly hypercubes (Q1043788) (← links)
- Score vectors of Kotzig tournaments (Q1070241) (← links)
- Sophisticated voting outcomes and agenda control (Q1079463) (← links)
- Cycles in bipartite tournaments (Q1154477) (← links)
- On multipartite tournaments (Q1179479) (← links)
- How hard is it to control an election? (Q1200886) (← links)
- On score sequences of \(k\)-hypertournaments (Q1590213) (← links)
- Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs (Q1708395) (← links)
- Inconsistency reduction in decision making via multi-objective optimisation (Q1754231) (← links)
- Spectral radii of tournament matrices whose graphs are related by an arc reversal (Q1805320) (← links)
- On the number of arcs in primitive digraphs with large exponents (Q1870076) (← links)
- Generalized morphology using sponges (Q1980868) (← links)
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints (Q2025066) (← links)
- Preference graph of potential method as a fuzzy graph (Q2036514) (← links)
- Contagion in networks: stability and efficiency (Q2070563) (← links)
- On negative dependence inequalities and maximal scores in round-robin tournaments (Q2128933) (← links)
- The efficacy of tournament designs (Q2147107) (← links)
- On the graph Laplacian and the rankability of data (Q2174433) (← links)
- Generalized intransitive dice: mimicking an arbitrary tournament (Q2246167) (← links)
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey (Q2277468) (← links)
- Tournaments, oriented graphs and football sequences (Q2399852) (← links)
- On the score sheets of a round-robin football tournament (Q2399885) (← links)
- Antimatroids and balanced pairs (Q2454046) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- A remark on cycles through an arc in strongly connected multipartite tournaments (Q2470348) (← links)
- On the problem of reconstructing a tournament from subtournaments (Q2524984) (← links)
- Pancyclic graphs. I (Q2535653) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture (Q4987265) (← links)
- Team's seasonal win probabilities (Q5051190) (← links)
- (Q5061404) (← links)
- Notes on weak-odd edge colorings of digraphs (Q5090189) (← links)
- An unexpected characteristic of tournament predictive power (Q5860205) (← links)
- Ranking and selection for pairwise comparison (Q6054757) (← links)
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments (Q6055389) (← links)
- Counting tournament score sequences (Q6106038) (← links)
- (Q6136002) (← links)
- Counting orientations of random graphs with no directed <i>k</i>‐cycles (Q6201038) (← links)