Strongly 2-connected orientations of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4164908 (Why is no real title available?)
- scientific article; zbMATH DE number 863470 (Why is no real title available?)
- A Reduction Method for Edge-Connectivity in Graphs
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Graph theory with applications
- Graphs on surfaces
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- On some connectivity properties of Eulerian graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- Packing of rigid spanning subgraphs and spanning trees
- The weak 3-flow conjecture and the weak circular flow conjecture
- Two‐connected orientations of Eulerian graphs
- What is on his mind?
Cited in
(36)- Two‐connected orientations of Eulerian graphs
- On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
- scientific article; zbMATH DE number 3875342 (Why is no real title available?)
- Strong orientations without even directed circuits
- Enumerating \(k\)-arc-connected orientations
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
- Strongly connected orientations of plane graphs
- On Eulerian orientations of even-degree hypercubes
- Graphs with many strong orientations
- Graphs for which all strong orientations are Eulerian
- The flow index and strongly connected orientations
- Tournaments and Semicomplete Digraphs
- Eulerian orientations and vertex-connectivity
- The maximum average connectivity among all orientations of a graph
- On Frank's conjecture on \(k\)-connected orientations
- Connectivity of orientations of 3-edge-connected graphs
- On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
- Weakly transitive orientations, Hasse diagrams and string graphs
- Lexicographic orientation algorithms
- One-way trail orientations
- The number of arcs of a strongly connected oriented graph with two noncritical vertices
- Orientations of infinite graphs with prescribed edge-connectivity
- Partially broken orientations of Eulerian graphs on closed surfaces
- Partially broken orientations of Eulerian plane graphs
- scientific article; zbMATH DE number 841577 (Why is no real title available?)
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
- On fully orientability of 2-degenerate graphs
- The complexity of 2-vertex-connected orientation in mixed graphs
- Good acyclic orientations of 4‐regular 4‐connected graphs
- scientific article; zbMATH DE number 1188910 (Why is no real title available?)
- On orientations maximizing total arc-connectivity
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- scientific article; zbMATH DE number 1185329 (Why is no real title available?)
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- On the Structure of the Strong Orientations of a Graph
This page was built for publication: Strongly 2-connected orientations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473099)
