Generalizations of tournaments: A survey
DOI10.1002/(SICI)1097-0118(199808)28:4%3C171::AID-JGT1%3E3.0.CO;2-GzbMATH Open0920.05033OpenAlexW4253426551MaRDI QIDQ4242937FDOQ4242937
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
Recommendations
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)
Cited In (40)
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
- Kernels and perfectness in arc-local tournament digraphs
- A relativized measure of circularity for tournaments
- 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
- A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
- On arc-traceable local tournaments
- Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
- Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Quasi-hamiltonian paths in semicomplete multipartite digraphs
- A classification of arc-locally semicomplete digraphs
- Degree complete graphs
- Locally Semicomplete Digraphs and Generalizations
- Title not available (Why is that?)
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)
