scientific article
From MaRDI portal
Publication:3872493
zbMath0434.05037MaRDI QIDQ3872493
K. Brooks Reid, Lowell W. Beineke
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
circuitsEnumerationExtremal problemsScoresstructural problemsAuthomorphisms of tournamentsRegularity in tournamentsSpanning paths
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Directed graphs (digraphs), tournaments (05C20)
Related Items (40)
Tournaments, flags, and harmonic maps ⋮ Counterexamples to Adám's conjecture on arc reversals in directed graphs ⋮ A directed graph version of strongly regular graphs ⋮ Arc reversals in tournaments ⋮ Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ Cycles of all lengths in arc-3-cyclic semicomplete digraphs ⋮ Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs ⋮ On the total distance between nodes in tournaments ⋮ A larger class of reconstructible tournaments ⋮ Condorcet choice correspondences: A set-theoretical comparison ⋮ Generalized scrambling indices of a primitive digraph ⋮ On the minimum Perron value for an irreducible tournament matrix ⋮ A characterization of unique tournaments ⋮ Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs ⋮ Ádám's conjecture ⋮ Weakly quasi-Hamiltonian-connected multipartite tournaments ⋮ The existence and uniqueness of strong kings in tournaments ⋮ An algorithm to generate tournament score sequences ⋮ Every vertex a king ⋮ Cycles of each length in tournaments ⋮ Voting Procedures, Complexity of ⋮ Multipartite tournaments: a survey ⋮ Near-homogeneous tournaments and permutation groups ⋮ On the structure of locally semicomplete digraphs ⋮ Autonomous parts and decomposition of regular tournaments ⋮ A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments ⋮ A tournament of order 14 with disjoint Banks and Slater sets ⋮ Extending partial tournaments ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Pick's inequality and tournaments ⋮ Spectral radii of tournament matrices whose graphs are related by an arc reversal ⋮ ESS patterns: Adding pairs to an ESS ⋮ 2-partition-transitive tournaments ⋮ Random generation of tournaments and asymmetric graphs with given out-degrees ⋮ A survey on the complexity of tournament solutions ⋮ On the complexity of Slater's problems ⋮ Upsets in round robin tournaments ⋮ Infinite families of -dichromatic vertex critical circulant tournaments ⋮ Tournament matrices with extremal spectral properties ⋮ An upper bound on the Perron value of an almost regular tournament matrix
This page was built for publication:
