Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
From MaRDI portal
Publication:503651
DOI10.1007/S00373-016-1724-9zbMath1353.05074DBLPjournals/gc/OkRT16OpenAlexW2460448338WikidataQ56926503 ScholiaQ56926503MaRDI QIDQ503651
Seongmin Ok, Carsten Thomassen, R. Bruce Richter
Publication date: 13 January 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/dccdd2f0-1427-40ad-9bf4-00031a8f6b4d
Cites Work
- Every 4k-edge-connected graph is weakly 3k-linked
- 2-linked graphs
- A sufficient condition for graphs to be weakly \(k\)-linked
- On a theorem of Mader
- Degree Bounded Network Design with Metric Costs
- Infinite, highly connected digraphs with no two arc-disjoint spanning trees
- A Reduction Method for Edge-Connectivity in Graphs
- Orientations of infinite graphs with prescribed edge-connectivity
This page was built for publication: Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
