Pages that link to "Item:Q1837196"
From MaRDI portal
The following pages link to Connectivity and edge-disjoint spanning trees (Q1837196):
Displaying 44 items.
- Extreme tenacity of graphs with given order and size (Q489128) (← links)
- Security games on matroids (Q507326) (← links)
- A proof of the molecular conjecture (Q540449) (← links)
- Balanced and 1-balanced graph constructions (Q608258) (← links)
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid (Q714036) (← links)
- Spanning trails containing given edges (Q817757) (← links)
- Minimum cost subpartitions in graphs (Q845968) (← links)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs (Q906435) (← links)
- Brick partitions of graphs (Q960924) (← links)
- Transforming a graph into a 1-balanced graph (Q1003673) (← links)
- A new algorithm for the intersection of a line with the independent set polytope of a matroid (Q1004529) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Fractional arboricity, strength, and principal partitions in graphs and matroids (Q1208447) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- A faster algorithm for computing the strength of a network (Q1318743) (← links)
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs (Q1861573) (← links)
- Strength of a graph and packing of trees and branchings (Q1895050) (← links)
- On the extended Clark-Wormold Hamiltonian-like index problem (Q2075501) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
- Graph vulnerability parameters, compression, and threshold graphs (Q2223690) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- Spanning tree packing number and eigenvalues of graphs with given girth (Q2321370) (← links)
- Degree sequence realizations with given packing and covering of spanning trees (Q2341721) (← links)
- Edge vulnerability parameters of split graphs (Q2371083) (← links)
- Hitting a path: a generalization of weighted connectivity via game theory (Q2424795) (← links)
- Edge-disjoint spanning trees and eigenvalues (Q2442253) (← links)
- Edge vulnerability parameters of bisplit graphs (Q2519517) (← links)
- Network reinforcement (Q2583121) (← links)
- Edge-disjoint Steiner trees and connectors in graphs (Q2701394) (← links)
- Packing the Steiner trees of a graph (Q3057108) (← links)
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs (Q3466350) (← links)
- Strength and reinforcement of a network and tree packing (Q4007379) (← links)
- Link Vulnerability in Networks (Q4640344) (← links)
- A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks (Q5087062) (← links)
- A Note on the Link Residual Closeness of Graphs Under Join Operation (Q5384124) (← links)
- (Q5708565) (← links)
- Risk‐averse optimization and resilient network flows (Q6139370) (← links)
- Computational complexity of network vulnerability analysis (Q6160687) (← links)
