Generalizations of tournaments: A survey

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199808)28:4<171::AID-JGT1>3.0.CO;2-G" /><171::AID-JGT1>3.0.CO;2-G 10.1002/(SICI)1097-0118(199808)28:4<171::AID-JGT1>3.0.CO;2-GzbMath0920.05033OpenAlexW4253426551MaRDI QIDQ4242937

Gregory 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<171::aid-jgt1>3.0.co;2-g

zbMATH Keywords

digraphstournaments

Mathematics Subject Classification ID

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

Related Items (28)

Orientations of digraphs almost preserving diameter ⋮ Degree complete graphs ⋮ On the complexity of kings ⋮ A characterization of locally semicomplete CKI-digraphs ⋮ Vertex pancyclic in-tournaments ⋮ Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs ⋮ Weakly quasi-Hamiltonian-connected multipartite tournaments ⋮ Independent sets and non-augmentable paths in generalizations of tournaments ⋮ A classification of all arc-locally semicomplete digraphs ⋮ Kernels and perfectness in arc-local tournament digraphs ⋮ Quasi-hamiltonian paths in semicomplete multipartite digraphs ⋮ Multipartite tournaments: a survey ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ When \(n\)-cycles in \(n\)-partite tournaments are longest cycles ⋮ Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments ⋮ On \(n\)-partite tournaments with unique \(n\)-cycle ⋮ Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments ⋮ On arc-traceable local tournaments ⋮ Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian ⋮ The structure of strong arc-locally semicomplete digraphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ A classification of arc-locally semicomplete digraphs ⋮ Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs ⋮ \(\alpha\)-diperfect digraphs

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