Every 4k-edge-connected graph is weakly 3k-linked

DOI10.1007/BF01787729zbMath0708.05036MaRDI QIDQ920108

Haruko Okamura

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

weakly k-linked

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (3)

A sufficient condition for graphs to be weakly \(k\)-linked ⋮ Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity ⋮ Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs

Cites Work

• Unnamed Item
• A sufficient condition for a graph to be weakly k-linked
• Paths and edge-connectivity in graphs
• Paths in graphs, reducing the edge-connectivity only by two
• Paths and edge-connectivity in graphs. III: Six-terminal k paths
• 2-linked graphs
• A Reduction Method for Edge-Connectivity in Graphs

This page was built for publication: Every 4k-edge-connected graph is weakly 3k-linked