The following pages link to (Q3872493):
Displaying 40 items.
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs (Q394200) (← links)
- Generalized scrambling indices of a primitive digraph (Q603109) (← links)
- Autonomous parts and decomposition of regular tournaments (Q686435) (← links)
- Weakly quasi-Hamiltonian-connected multipartite tournaments (Q898116) (← links)
- A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments (Q960957) (← links)
- A tournament of order 14 with disjoint Banks and Slater sets (Q968179) (← links)
- Extending partial tournaments (Q969878) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- Upsets in round robin tournaments (Q1054743) (← links)
- Tournaments, flags, and harmonic maps (Q1079244) (← links)
- Counterexamples to Adám's conjecture on arc reversals in directed graphs (Q1086583) (← links)
- A directed graph version of strongly regular graphs (Q1101124) (← links)
- Arc reversals in tournaments (Q1102300) (← links)
- Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs (Q1117243) (← links)
- Every vertex a king (Q1162521) (← links)
- Cycles of each length in tournaments (Q1169475) (← links)
- Near-homogeneous tournaments and permutation groups (Q1193708) (← links)
- On the structure of locally semicomplete digraphs (Q1198647) (← links)
- 2-partition-transitive tournaments (Q1272476) (← links)
- Random generation of tournaments and asymmetric graphs with given out-degrees (Q1278398) (← links)
- Tournament matrices with extremal spectral properties (Q1316183) (← links)
- Cycles of all lengths in arc-3-cyclic semicomplete digraphs (Q1367024) (← links)
- Condorcet choice correspondences: A set-theoretical comparison (Q1377475) (← links)
- A characterization of unique tournaments (Q1386429) (← links)
- An algorithm to generate tournament score sequences (Q1410980) (← links)
- Pick's inequality and tournaments (Q1801444) (← links)
- Spectral radii of tournament matrices whose graphs are related by an arc reversal (Q1805320) (← links)
- ESS patterns: Adding pairs to an ESS (Q1817522) (← links)
- An upper bound on the Perron value of an almost regular tournament matrix (Q1863540) (← links)
- On the total distance between nodes in tournaments (Q1916391) (← links)
- A larger class of reconstructible tournaments (Q1917492) (← links)
- On the minimum Perron value for an irreducible tournament matrix (Q1923219) (← links)
- The existence and uniqueness of strong kings in tournaments (Q2427527) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- Infinite families of -dichromatic vertex critical circulant tournaments (Q3439577) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Ádám's conjecture (Q6038575) (← links)
