On edge transitivity of directed graphs
From MaRDI portal
Recommendations
- On transitive orientations of G-e
- scientific article; zbMATH DE number 3939387
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
- scientific article; zbMATH DE number 3847443
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
Cites work
- scientific article; zbMATH DE number 19214 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3588700 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Betweenness, orders and interval graphs
- Complexity of diagrams
- Dimension transitiv orientierbarer graphen
- On cliques in graphs
- Orientations of circle graphs
- Recognizing circle graphs in polynomial time
- Reconnaissance des graphes de cordes
- Reducing prime graphs and recognizing circle graphs
- The Complexity of Enumeration and Reliability Problems
- The Complexity of the Partial Order Dimension Problem
- The Dimension of a Comparability Graph
Cited in
(4)
This page was built for publication: On edge transitivity of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894773)