scientific article; zbMATH DE number 863470
From MaRDI portal
Publication:4871749
zbMath0846.05055MaRDI QIDQ4871749
Publication date: 29 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyconnectivityflowstreescritical graphsarborescencesdisjoint pathsspanning treesMenger's theoremnetwork flow problemsWhitney's theoremcirculations and flowsFord-Fulkerson's algorithmpaths and reachabilitypaths of minimum cost
Related Items (40)
Increasing digraph arc-connectivity by arc addition, reversal and complement ⋮ The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. ⋮ Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Chromatic characterization of biclique covers ⋮ On constructive characterizations of \((k,l)\)-sparse graphs ⋮ Strong connectivity of polyhedral complexes ⋮ Optimal wavelength-routed multicasting ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Packing of rigid spanning subgraphs and spanning trees ⋮ Complexity of (arc)-connectivity problems involving arc-reversals or deorientations ⋮ The complexity of 2-vertex-connected orientation in mixed graphs ⋮ Approximating directed weighted-degree constrained networks ⋮ Graph varieties in high dimension ⋮ Constructive characterizations for packing and covering with trees ⋮ Unnamed Item ⋮ Eulerian orientations and vertex-connectivity ⋮ Approximating Directed Weighted-Degree Constrained Networks ⋮ Strongly 2-connected orientations of graphs ⋮ A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms ⋮ The lattice of cycles of an undirected graph ⋮ Orientations of graphs with prescribed weighted out-degrees ⋮ Short disjoint paths in locally connected graphs ⋮ On orienting graphs for connectivity: Projective planes and Halin graphs ⋮ Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs ⋮ On minimum power connectivity problems ⋮ Rigidity, global rigidity, and graph decomposition ⋮ Approximating minimum power covers of intersecting families and directed edge-connectivity problems ⋮ What is on his mind? ⋮ Disjoint paths in arborescences ⋮ Multiflows in symmetric digraphs ⋮ Simultaneous well-balanced orientations of graphs ⋮ Extremal infinite graph theory ⋮ On Frank's conjecture on \(k\)-connected orientations ⋮ Partial cubes: Structures, characterizations, and constructions ⋮ Disjoint paths in symmetric digraphs ⋮ On Eulerian orientations of even-degree hypercubes ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ On one maximum multiflow problem and related metrics ⋮ On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs ⋮ Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs
This page was built for publication:
