scientific article; zbMATH DE number 3303831

Cited in

(only showing first 100 items - show all)

On the complexity of crossings in permutations
Choosing from a large tournament
Preserving regular tournaments and term rank-1
A survey on the complexity of tournament solutions
On the complexity of Slater's problems
The interchange graphs of tournaments with minimum score vectors are exactly hypercubes
Canonical Ramsey numbers and properly colored cycles
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
On the asymptotic number of tournament score sequences
Upsets in round robin tournaments
On score sets for tournaments
On Ramsey-Turán type problems in tournaments
On the number of tournaments with prescribed score vector
The extension to root systems of a theorem on tournaments
Universal tilings and universal (0,1)-matrices
Tournaments, flags, and harmonic maps
Sophisticated voting outcomes and agenda control
The Copeland choice function. An axiomatic characterization
Tournament methods in choice theory
Choosing from a tournament
On a generalization of transitivity for digraphs
Arc reversals in tournaments
On finding a minimum dominating set in a tournament
Score sequences: Lexicographic enumeration and tournament construction
Asymptotic normality of graph statistics
Bipartite graphs obtained from adjacency matrices of orientations of graphs
Hamiltonian-connected tournaments
On the number of Hamiltonian cycles in tournaments
A four-element algebra whose identities are not finitely based
Some strategic properties of plurality and majority voting
Cycles in bipartite tournaments
A branch and bound algorithm for the acyclic subgraph problem
On the decomposition of a graph into stars
Every vertex a king
The median procedure in cluster analysis and social choice theory
Complexity of finding k-path-free dominating sets in graphs
Yet another method of enumerating unmarked combinatorial objects
Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure
Angle orders and zeros
Ordering pairwise comparison structures
On multipartite tournaments
On tournament matrices
Algebraic multiplicity of the eigenvalues of a tournament matrix
Integral matrices with given row and column sums
Partitions, packings and coverings by families with nonempty intersections
Path numbers of tournaments
A problem on arcs without bypasses in tournaments
Either tournaments or algebras?
Distances in orientations of graphs
Groupes de permutations primitifs d'ordre impair et denombrement de tournois sommet-primitifs
Strongly self-complementary and hereditarily isomorphic tournaments
Edge sets contained in circuits
The maximum number of K_j-subgraphs in a graph with k independent edges
On the chromatic index of almost all graphs
Mixtures of order matrices and generalized order matrices
Manipulation of social choice rules by strategic nomination of candidates
Solution of the Hamiltonian problem for self-complementary graphs
On removing a vertex from the assignment polytope
2-partition-transitive tournaments
Measuring intransitivity
Random generation of tournaments and asymmetric graphs with given out-degrees
The polytope of win vectors
On -majority voting paradoxes
Perron vector ordering for a subclass of tournament matrices
Irreducible matrices with reducible principal submatrices
On some useful properties of the Perron eigenvalue of a positive reciprocal matrix in the context of the analytic hierarchy process
On local characterizations of Hamiltonian tournaments
On sets of integers with prescribed gaps
Tournament matrices with extremal spectral properties
Primitive 2-structures with the (n-2)-property
Note on eccentricities in tournaments
The Copeland measure of Condorcet choice functions
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
A classification of locally semicomplete digraphs
Path-connectivity in local tournaments
New results on the computation of median orders
Ordered and canonical Ramsey numbers of stars
Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments
On solving intransitivities in repeated pairwise choices
Condorcet choice correspondences: A set-theoretical comparison
A characterization of unique tournaments
An algorithm to generate tournament score sequences
A central partition of molecular conformational space. I: Basic structures
Homomorphisms and oriented colorings of equivalence classes of oriented graphs
On approximability of linear ordering and related NP-optimization problems on graphs.
Comparing the efficacy of ranking methods for multiple round-robin tournaments
Kings in quasi-transitive digraphs
A combinatorial interpretation of the inverse \(t\)-Kostka matrix.
Efficient enumeration of graph orientations with sources
Disjoint cycles of different lengths in graphs and digraphs
On the reducibility of sets inside NP to sets with low information content
Degree constrained 2-partitions of semicomplete digraphs
Pick's inequality and tournaments
Spectral radii of tournament matrices whose graphs are related by an arc reversal
Chromatic numbers of competition graphs
Some asymptotic formulas for lattice paths
Ranking whist players
Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number
Random regular tournaments
Some Ramsey nu mbers for directed graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585195)