On orienting graphs for connectivity: Projective planes and Halin graphs
From MaRDI portal
Recommendations
Cites work
- An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
- Connections in combinatorial optimization
- Graph theory
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 4164908 (Why is no real title available?)
- scientific article; zbMATH DE number 863470 (Why is no real title available?)
- scientific article; zbMATH DE number 3346402 (Why is no real title available?)
- Network Flow and Testing Graph Connectivity
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- Simultaneous well-balanced orientations of graphs
- The vertex-connectivity of a distance-regular graph
- Two‐connected orientations of Eulerian graphs
Cited in
(5)- Connectivity of orientations of 3-edge-connected graphs
- Computing the orientable genus of projective graphs
- Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
- The Nash-Williams orientation theorem for graphs with countably many ends
- Towards Nash-Williams orientation conjecture for infinite graphs
This page was built for publication: On orienting graphs for connectivity: Projective planes and Halin graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758272)