scientific article; zbMATH DE number 863470
From MaRDI portal
Publication:4871749
zbMATH Open0846.05055MaRDI QIDQ4871749FDOQ4871749
Authors: András Frank 
Publication date: 29 September 1996
Title of this publication is not available (Why is that?)
Recommendations
spanning treessurveytreesconnectivitydisjoint pathscritical graphsflowsMenger's theoremnetwork flow problemsarborescencesWhitney's theoremcirculations and flowsFord-Fulkerson's algorithmpaths and reachabilitypaths of minimum cost
Cited In (47)
- Disjoint paths in arborescences
- Title not available (Why is that?)
- Packing of rigid spanning subgraphs and spanning trees
- The lattice of cycles of an undirected graph
- On minimum power connectivity problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Non-interfering network flows
- Chromatic characterization of biclique covers
- On one maximum multiflow problem and related metrics
- Increasing digraph arc-connectivity by arc addition, reversal and complement
- Rerouting Flows when Links Fail
- The complexity of 2-vertex-connected orientation in mixed graphs
- On constructive characterizations of \((k,l)\)-sparse graphs
- Multiflows in symmetric digraphs
- Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs
- Short disjoint paths in locally connected graphs
- On Frank's conjecture on \(k\)-connected orientations
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Partial cubes: Structures, characterizations, and constructions
- Disjoint paths in symmetric digraphs
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- Eulerian orientations and vertex-connectivity
- On orienting graphs for connectivity: Projective planes and Halin graphs
- Connectivity, stability and efficiency in a network as an information flow
- Connectivity of Kautz networks
- Network Analysis
- Optimal wavelength-routed multicasting
- Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
- Simultaneous well-balanced orientations of graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- Constructive characterizations for packing and covering with trees
- Approximating Directed Weighted-Degree Constrained Networks
- On Eulerian orientations of even-degree hypercubes
- Strongly 2-connected orientations of graphs
- Extremal infinite graph theory
- Connectivity algorithms
- What is on his mind?
- Title not available (Why is that?)
- Graph varieties in high dimension
- Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
- Strong connectivity of polyhedral complexes
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- Orientations of graphs with prescribed weighted out-degrees
- Approximating directed weighted-degree constrained networks
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
- Rigidity, global rigidity, and graph decomposition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871749)
