On transitive orientations with restricted covering graphs
From MaRDI portal
(Redirected from Publication:845912)
Recommendations
- scientific article; zbMATH DE number 3939387
- Transitive Orientations of Graphs
- Reorientations of covering graphs
- \(st\)-orientations with few transitive edges
- $st$-Orientations with Few Transitive Edges
- Transitive orientations in bull-reducible Berge graphs
- Graphs whose every transitive orientation contains almost every relation
- Transversals of circuits and acyclic orientations in graphs and matroids
- Degree constrained orientations in countable graphs
- On Cover Graphs and Dependent Arcs in Acyclic Orientations
Cites work
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 3908482 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- A Fast Algorithm for the Decomposition of Graphs and Posets
- Efficient and practical algorithms for sequential modular decomposition
- Graph-Theoretic Concepts in Computer Science
- Matrix multiplication via arithmetic progressions
- Modular decomposition and transitive orientation
- Sources and sinks in comparability graphs
- Transitiv orientierbare Graphen
Cited in
(8)- Weakly transitive orientations, Hasse diagrams and string graphs
- Reorientations of covering graphs
- Extending partial suborders
- Construction of a transitive orientation using B-stable subgraphs
- Realizing finite edge-transitive orientable maps
- scientific article; zbMATH DE number 637327 (Why is no real title available?)
- scientific article; zbMATH DE number 1554932 (Why is no real title available?)
- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
This page was built for publication: On transitive orientations with restricted covering graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845912)