A sufficient condition for graphs to be weakly \(k\)-linked

DOI10.1007/BF01787639zbMath0780.05036MaRDI QIDQ1180674

Andreas Huck

Publication date: 27 June 1992

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

zbMATH Keywords

pathcutlinked graphsedge-connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (9)

Linkage on the infinite grid ⋮ Networks communicating for each pairing of terminals ⋮ On the maximum degree of path-pairable planar graphs ⋮ Terminal-pairability in complete bipartite graphs ⋮ On low degree \(k\)-ordered graphs ⋮ Three-regular path pairable graphs ⋮ Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity ⋮ The path-pairability number of product of stars ⋮ Highly linked graphs

Cites Work

• Unnamed Item
• Paths and edge-connectivity in graphs
• Every 4k-edge-connected graph is weakly 3k-linked
• 2-linked graphs
• Eine Reduktionsmethode für den Kantenzusammenhang in Graphen

This page was built for publication: A sufficient condition for graphs to be weakly \(k\)-linked