scientific article
From MaRDI portal
Publication:3718456
zbMath0589.90025MaRDI QIDQ3718456
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Paths and edge-connectivity in graphs. III: Six-terminal k paths ⋮ Shortest edge-disjoint paths in graphs ⋮ Every 4k-edge-connected graph is weakly 3k-linked ⋮ A sufficient condition for graphs to be weakly \(k\)-linked ⋮ Bounds on path connectivity ⋮ 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
This page was built for publication:
