The structure of strong arc-locally in-semicomplete digraphs
From MaRDI portal
Publication:1045196
DOI10.1016/j.disc.2009.06.033zbMath1183.05032OpenAlexW2017430327MaRDI QIDQ1045196
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.06.033
digraphssemicomplete digrapharc-locally semicomplete digrapharc-locally in-semicomplete digraphsemicomplete bipartite digraph
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)
Related Items
\( \chi \)-diperfect digraphs ⋮ Some results on Berge's conjecture and begin-end conjecture ⋮ Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor ⋮ Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs ⋮ A classification of all arc-locally semicomplete digraphs ⋮ A conjecture on 3-anti-quasi-transitive digraphs ⋮ Efficient total domination in digraphs ⋮ Critical kernel imperfect problem in generalizations of bipartite tournaments ⋮ On the structure of strong 3-quasi-transitive digraphs ⋮ Supereulerian 3-path-quasi-transitive digraphs ⋮ Miscellaneous Digraph Classes
Cites Work
- A classification of locally semicomplete digraphs
- Path-connectivity in local tournaments
- Paths and cycles in extended and decomposable digraphs
- The structure of strong arc-locally semicomplete digraphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Kernels and perfectness in arc-local tournament digraphs
- Locally semicomplete digraphs: A generalization of tournaments