Reachability relations and the structure of transitive digraphs
From MaRDI portal
Publication:1010932
zbMATH Open1178.05051MaRDI QIDQ1010932FDOQ1010932
Authors: Norbert Seifter, V. I. Trofimov 
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117305
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cited In (11)
- Reachability relations in digraphs
- Title not available (Why is that?)
- On the number of reachable pairs in a digraph
- An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
- Title not available (Why is that?)
- Spanners and Reachability Oracles for Directed Transmission Graphs
- Descendant-homogeneous digraphs
- The number of reachable pairs in a digraph
- Point- and arc-reaching sets of vertices in a digraph
- Distance-transitive digraphs: descendant-homogeneity, property \(Z\) and reachability
- Reachability relations, transitive digraphs and groups
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)
