On orienting graphs for connectivity: Projective planes and Halin graphs
From MaRDI portal
Publication:1758272
DOI10.1016/j.orl.2012.06.004zbMath1252.05099OpenAlexW1967825174MaRDI QIDQ1758272
Chenglong Zou, Joseph Cheriyan
Publication date: 8 November 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.06.004
Cites Work
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
- The vertex-connectivity of a distance-regular graph
- Simultaneous well-balanced orientations of graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
- Network Flow and Testing Graph Connectivity
- Two‐connected orientations of Eulerian graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On orienting graphs for connectivity: Projective planes and Halin graphs