Locally semicomplete digraphs: A generalization of tournaments
From MaRDI portal
Recommendations
Cited in
(83)- On the number of cycles in local tournaments
- Some sufficient conditions for the existence of kernels in infinite digraphs
- The structure of strong arc-locally in-semicomplete digraphs
- On the structure of locally semicomplete digraphs
- Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- Multiplicativity of acyclic local tournaments
- A note on spanning local tournaments in locally semicomplete digraphs
- Vertex deletion and cycles in multipartite tournaments
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- On chordal proper circular arc graphs
- On complementary cycles in locally semicomplete digraphs
- A classification of locally semicomplete digraphs
- Path-connectivity in local tournaments
- Paths and cycles in extended and decomposable digraphs
- About weak connectivity
- Cycles of all lengths in arc-3-cyclic semicomplete digraphs
- On the exponent set of primitive locally semicomplete digraphs
- Spanning local tournaments in locally semicomplete digraphs
- Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs
- Finding complementary cycles in locally semicomplete digraphs
- The structure of strong arc-locally semicomplete digraphs
- Weakly Hamiltonian-connected ordinary multipartite tournaments
- Almost minimum diameter orientations of semicomplete multipartite and extended digraphs
- Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
- Vertex-disjoint cycles in local tournaments
- Chordality of locally semicomplete and weakly quasi-transitive digraphs
- The domination number of round digraphs
- On the complexity of singly connected vertex deletion
- Obstructions for acyclic local tournament orientation completions
- \(\alpha\)-diperfect digraphs
- \( \chi \)-diperfect digraphs
- The second out-neighborhood for local tournaments
- Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments
- On ideal semicomplete digraphs
- Universal arcs in local tournaments
- Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments
- Independent sets and non-augmentable paths in generalizations of tournaments
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- All 2-connected in-tournaments that are cycle complementary
- Longest path partitions in generalizations of tournaments
- The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
- Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs
- Decomposing and colouring some locally semicomplete digraphs
- Vertex pancyclic in-tournaments
- Non-critical vertices and long circuits in strong tournaments of order n and diameter d
- Tournaments and Semicomplete Digraphs
- Locally Semicomplete Digraphs and Generalizations
- Lexicographic orientation algorithms
- Sufficient conditions for locally in (out)-semicomplete digraphs to be traceable
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- Traceable property of extended locally in(out)-semicomplete digraph
- A characterization of locally semicomplete CKI-digraphs
- A sufficient condition for a digraph to be positive-round
- Traceable properties of locally in/out-semicomplete digraph
- Disjoint quasi-kernels in digraphs
- Kings in locally semicomplete digraphs
- Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
- A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic
- Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs
- scientific article; zbMATH DE number 403948 (Why is no real title available?)
- Connectivity properties of locally semicomplete digraphs
- scientific article; zbMATH DE number 804599 (Why is no real title available?)
- Some results on the existence of Hamiltonian cycles in \(\mathcal{P} \)-compositions of bipartite digraphs
- On the Complexity of Singly Connected Vertex Deletion
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
- Disjoint paths in decomposable digraphs
- Spanning 3-strong tournaments in 5-strong semicomplete digraphs
- Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs
- Semi-strict chordality of digraphs
- Towards transitive-free digraphs
- On the structure of strong 3-quasi-transitive digraphs
- The complexity of colouring by locally semicomplete digraphs
- \(H\)-force sets of locally semicomplete digraphs
- Locally semicomplete multipartite digraphs: a generalization of both locally semicomplete digraphs and semicomplete multipartite digraphs
- Weakly quasi-Hamiltonian-connected multipartite tournaments
- Cycle factors in strongly connected local tournaments
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs
- Spanning 2-strong tournaments in 3-strong semicomplete digraphs
- Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three
- On arc-traceable local tournaments
This page was built for publication: Locally semicomplete digraphs: A generalization of tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3481724)
