On a generalization of transitivity for digraphs
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- Reachability relations and the structure of transitive digraphs
- Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs
- Some extremal properties concerning transitivity in graphs
- Construction of a transitive reduction of an acyclic digraph
- Bigraphs and transitions
- k-transitive digraphs and topologies
- The transitive closure of a random digraph
- scientific article; zbMATH DE number 4156471 (Why is no real title available?)
- scientific article; zbMATH DE number 4156472 (Why is no real title available?)
- Transitive index of digraph with \( g\) zero-strong components
- scientific article; zbMATH DE number 1185600 (Why is no real title available?)
- Some remarks on the structure of strong k-transitive digraphs
- Quasi‐transitive digraphs
- Some results on 4-transitive digraphs
- scientific article; zbMATH DE number 5237243 (Why is no real title available?)
- -TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION
- The maximal transitive subtournaments of a digraph: the operator
This page was built for publication: On a generalization of transitivity for digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100476)