Publication:3718456
From MaRDI portal
zbMath0589.90025MaRDI QIDQ3718456
Publication date: 1984
90B10: Deterministic network models in operations research
Related Items
Bounds on path connectivity, A sufficient condition for a graph to be weakly k-linked, Paths and edge-connectivity in graphs, Every 4k-edge-connected graph is weakly 3k-linked, Paths in graphs, reducing the edge-connectivity only by two, Paths and edge-connectivity in graphs. III: Six-terminal k paths, A sufficient condition for graphs to be weakly \(k\)-linked