Generalizations of tournaments: A survey

DOI10.1002/(SICI)1097-0118(199808)28:4%3C171::AID-JGT1%3E3.0.CO;2-GMaRDI QIDQ4242937zbMATH OpenOpenAlexFDO

Authors G. Gutin, Jørgen Bang-Jensen

Publication date 10 September 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199808)28:4%3C171::aid-jgt1%3E3.0.co;2-g

zbMATH Keywords

digraphstournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Tournaments and Semicomplete Digraphs
• scientific article; zbMATH DE number 1868896
• scientific article; zbMATH DE number 1156581
• scientific article; zbMATH DE number 147652

Cited in

(40)

• Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
• A relativized measure of circularity for tournaments
• Kernels and perfectness in arc-local tournament digraphs
• Orientations of digraphs almost preserving diameter
• Arc-disjoint out- and in-branchings in compositions of digraphs
• Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
• \(\alpha\)-diperfect digraphs
• On the complexity of kings
• Linkages in locally semicomplete digraphs and quasi-transitive digraphs
• Quasi-transitive digraphs and their extensions
• Homogeneous tournaments revisited
• A classification of all arc-locally semicomplete digraphs
• A survey on the complexity of tournament solutions
• Some remarks on simple tournaments
• On arc-traceable local tournaments
• A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
• Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
• Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
• The structure of strong arc-locally semicomplete digraphs
• When n-cycles in n-partite tournaments are longest cycles
• Vertex pancyclic in-tournaments
• All 2-connected in-tournaments that are cycle complementary
• On the number of update digraphs and its relation with the feedback arc sets and tournaments
• Multipartite tournaments: a survey
• Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
• Independent sets and non-augmentable paths in generalizations of tournaments
• Weakly quasi-Hamiltonian-connected multipartite tournaments
• On \(n\)-partite tournaments with unique \(n\)-cycle
• scientific article; zbMATH DE number 1868896 (Why is no real title available?)
• A characterization of locally semicomplete CKI-digraphs
• Tournaments and Semicomplete Digraphs
• Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• On the functional completeness of simple tournaments
• Quasi-hamiltonian paths in semicomplete multipartite digraphs
• scientific article; zbMATH DE number 6383861 (Why is no real title available?)
• A classification of arc-locally semicomplete digraphs
• Degree complete graphs
• Locally Semicomplete Digraphs and Generalizations
• scientific article; zbMATH DE number 1823770 (Why is no real title available?)

This page was built for publication: Generalizations of tournaments: A survey

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