scientific article; zbMATH DE number 863470
From MaRDI portal
Publication:4871749
Recommendations
Cited in
(49)- Disjoint paths in symmetric digraphs
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- Optimal wavelength-routed multicasting
- Constructive characterizations for packing and covering with trees
- On one maximum multiflow problem and related metrics
- Increasing digraph arc-connectivity by arc addition, reversal and complement
- On orienting graphs for connectivity: Projective planes and Halin graphs
- Disjoint paths in arborescences
- Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
- Strong connectivity of polyhedral complexes
- Graph varieties in high dimension
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Eulerian orientations and vertex-connectivity
- The lattice of cycles of an undirected graph
- Extremal infinite graph theory
- On Frank's conjecture on \(k\)-connected orientations
- On Eulerian orientations of even-degree hypercubes
- Chromatic characterization of biclique covers
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
- Short disjoint paths in locally connected graphs
- 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
- Approximating Directed Weighted-Degree Constrained Networks
- Packing of rigid spanning subgraphs and spanning trees
- scientific article; zbMATH DE number 1161250 (Why is no real title available?)
- Connectivity algorithms
- Strongly 2-connected orientations of graphs
- scientific article; zbMATH DE number 845618 (Why is no real title available?)
- Orientations of graphs with prescribed weighted out-degrees
- Non-interfering network flows
- Rerouting Flows when Links Fail
- Network Analysis
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
- The complexity of 2-vertex-connected orientation in mixed graphs
- scientific article; zbMATH DE number 7692724 (Why is no real title available?)
- Approximating directed weighted-degree constrained networks
- Connectivity of Kautz networks
- Highly connected orientations from edge-disjoint rigid subgraphs
- What is on his mind?
- Multiflows in symmetric digraphs
- On constructive characterizations of (k,l)-sparse graphs
- On minimum power connectivity problems
- Rigidity, global rigidity, and graph decomposition
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Connectivity, stability and efficiency in a network as an information flow
- Partial cubes: Structures, characterizations, and constructions
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)
