Shortest edge-disjoint paths in graphs
From MaRDI portal
Publication:5096182
DOI10.1007/BFb0029011zbMath1495.05153OpenAlexW2096782096MaRDI QIDQ5096182
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0029011
Cites Work
- Unnamed Item
- Unnamed Item
- Disjoint shortest paths in graphs
- A sufficient condition for a graph to be weakly k-linked
- 2-linked graphs
- Mengerian theorems for paths of bounded length
- Constructing disjoint paths on expander graphs
- Graph minors. XIII: The disjoint paths problem
- Geodetic connectivity of graphs
- The subgraph homeomorphism problem