Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
type: Item
instance of: scholarly article
title: Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
zbMATH Open document ID: 1353.05074
author: Seongmin Ok
author: R. B. Richter
author: Carsten Thomassen
published in: Graphs and Combinatorics
publication date: 2017-01-13T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6674447
zbMATH Keywords: edge-connectivity
zbMATH Keywords: lifting
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2460448338
Wikidata QID: Q56926503
cites work: Infinite, highly connected digraphs with no two arc-disjoint spanning trees
cites work: Degree bounded network design with metric costs
cites work: On a theorem of Mader
cites work: A sufficient condition for graphs to be weakly \(k\)-linked
cites work: A Reduction Method for Edge-Connectivity in Graphs
cites work: Every 4k-edge-connected graph is weakly 3k-linked
cites work: 2-linked graphs
cites work: Orientations of infinite graphs with prescribed edge-connectivity
DBLP publication ID: journals/gc/OkRT16
DOI: 10.1007/S00373-016-1724-9
Recommended article: Orientations of infinite graphs with prescribed edge-connectivity
Recommended article: Paths and edge-connectivity in graphs
Recommended article: A sufficient condition for graphs to be weakly \(k\)-linked
Recommended article: Every 4k-edge-connected graph is weakly 3k-linked
Recommended article: Q5463585
description: scientific article; zbMATH DE number 6674447