The following pages link to (Q5585195):
Displaying 50 items.
- Kings and heirs: a characterization of the \((2, 2)\)-domination graphs of tournaments (Q266825) (← links)
- Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\) (Q295269) (← links)
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- Domination in 3-tournaments (Q346441) (← links)
- On high-dimensional acyclic tournaments (Q393743) (← links)
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs (Q394200) (← links)
- Note on upper density of quasi-random hypergraphs (Q396781) (← links)
- On linear programming duality and Landau's characterization of tournament (Q399504) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- A survey on Hamilton cycles in directed graphs (Q412269) (← links)
- Rainbow connection in oriented graphs (Q477332) (← links)
- Asymptotically optimal induced universal graphs (Q521601) (← links)
- Concordance and consensus (Q545367) (← links)
- Cycle extendability in graphs and digraphs (Q550650) (← links)
- Dynamic resource location with tropical algebra (Q550683) (← links)
- A central partition of molecular conformational space. III. Combinatorial determination of the volume spanned by a molecular system (Q551838) (← links)
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
- The radii of n-partite tournaments (Q582300) (← links)
- Digraphs that have at most one walk of a given length with the same endpoints (Q616364) (← links)
- The (1,2)-step competition graph of a tournament (Q617643) (← links)
- Maximum distance between Slater orders and Copeland orders of tournaments (Q633222) (← links)
- On incentive compatible competitive selection protocols (Q639276) (← links)
- Voting almost maximizes social welfare despite limited communication (Q646516) (← links)
- Sublinear-time algorithms for tournament graphs (Q652634) (← links)
- The minimal covering set in large tournaments (Q656810) (← links)
- On biclique partitions of the complete graph (Q686164) (← links)
- Autonomous parts and decomposition of regular tournaments (Q686435) (← links)
- Towards an axiomatization of orderings (Q687178) (← links)
- A relativized measure of circularity for tournaments (Q690089) (← links)
- Ear decomposition for pair comparison data (Q696936) (← links)
- Edge-disjoint Hamilton cycles in graphs (Q713971) (← links)
- Unique nontransitive additive conjoint measurement on finite sets (Q751941) (← links)
- Largest digraphs contained in all n-tournaments (Q788740) (← links)
- The relationship between two algorithms for decisions via sophisticated majority voting with an agenda (Q804450) (← links)
- Bounds on the number of compatible \(k\)-simplices matching the orientation of the \((k-1)\)-skeleton of a simplex (Q822644) (← links)
- Generalized intransitive dice. II: Partition constructions (Q825253) (← links)
- Stabbing simplices by points and flats (Q848667) (← links)
- Score sets in \(k\)-partite tournaments (Q854436) (← links)
- Cycles in oriented 3-graphs (Q894680) (← links)
- Weakly quasi-Hamiltonian-connected multipartite tournaments (Q898116) (← links)
- Cyclic tournaments and cooperative majority voting: A solution (Q912750) (← links)
- On mark sequences in 2-digraphs (Q949326) (← links)
- Ranking participants in tournaments by means of rating functions (Q952697) (← links)
- On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\) (Q966016) (← 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)
- Hamiltonian degree sequences in digraphs (Q974465) (← links)
- A note on the query complexity of the Condorcet winner problem (Q975500) (← links)
- A characterization of the Copeland solution (Q985210) (← links)
