Reachability relations and the structure of transitive digraphs
From MaRDI portal
(Redirected from Publication:1010932)
Recommendations
- Reachability relations in digraphs
- Reachability relations, transitive digraphs and groups
- On a generalization of transitivity for digraphs
- Reachability problems for transmission graphs
- Reachability problems for transmission graphs
- Relational Galois connections between transitive digraphs: characterization and construction
- Reachability on prefix-recognizable graphs
- Accessibility in transitive graphs
- An infinite family of half-arc-transitive graphs with universal reachability relation
- The graph of reflexive-transitive relations and the graph of finite topologies
Cited in
(11)- scientific article; zbMATH DE number 5885701 (Why is no real title available?)
- Descendant-homogeneous digraphs
- The number of reachable pairs in a digraph
- Distance-transitive digraphs: descendant-homogeneity, property \(Z\) and reachability
- An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
- scientific article; zbMATH DE number 1504829 (Why is no real title available?)
- On the number of reachable pairs in a digraph
- Reachability relations, transitive digraphs and groups
- Point- and arc-reaching sets of vertices in a digraph
- Reachability relations in digraphs
- Spanners and Reachability Oracles for Directed Transmission Graphs
This page was built for publication: Reachability relations and the structure of transitive digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010932)
