Connectivity and edge-disjoint spanning trees
From MaRDI portal
Publication:1837196
DOI10.1016/0020-0190(83)90031-5zbMath0507.05030OpenAlexW2059772103MaRDI QIDQ1837196
Publication date: 1983
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(83)90031-5
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (45)
Edge vulnerability parameters of split graphs ⋮ Minimum cost subpartitions in graphs ⋮ Strength of a graph and packing of trees and branchings ⋮ Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs ⋮ Strength and reinforcement of a network and tree packing ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Balanced and 1-balanced graph constructions ⋮ The parity Hamiltonian cycle problem ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Hitting a path: a generalization of weighted connectivity via game theory ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Risk‐averse optimization and resilient network flows ⋮ Computational complexity of network vulnerability analysis ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Edge-disjoint Steiner trees and connectors in graphs ⋮ Edge-disjoint spanning trees and eigenvalues ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ A Note on the Link Residual Closeness of Graphs Under Join Operation ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ Extreme tenacity of graphs with given order and size ⋮ Forests, frames, and games: Algorithms for matroid sums and applications ⋮ Link Vulnerability in Networks ⋮ Security games on matroids ⋮ Edge-disjoint spanning trees and the number of maximum state circles of a graph ⋮ Brick partitions of graphs ⋮ Fractional arboricity, strength, and principal partitions in graphs and matroids ⋮ A proof of the molecular conjecture ⋮ Greedy splitting algorithms for approximating multiway partition problems ⋮ Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid ⋮ Packing the Steiner trees of a graph ⋮ Transforming a graph into a 1-balanced graph ⋮ A new algorithm for the intersection of a line with the independent set polytope of a matroid ⋮ Edge vulnerability parameters of bisplit graphs ⋮ Network strength games: the core and the nucleolus ⋮ Unnamed Item ⋮ Spanning tree packing number and eigenvalues of graphs with given girth ⋮ On the extended Clark-Wormold Hamiltonian-like index problem ⋮ Random sampling and greedy sparsification for matroid optimization problems ⋮ Degree sequence realizations with given packing and covering of spanning trees ⋮ On some algorithmic aspects of hypergraphic matroids ⋮ Network reinforcement ⋮ Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs ⋮ Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness ⋮ A faster algorithm for computing the strength of a network ⋮ Spanning trails containing given edges
Cites Work
This page was built for publication: Connectivity and edge-disjoint spanning trees
