Pages that link to "Item:Q3286077"
From MaRDI portal
The following pages link to Edge-Disjoint Spanning Trees of Finite Graphs (Q3286077):
Displayed 50 items.
- On the higher-order edge toughness of a graph (Q686452) (← links)
- Covering weighted graphs by even subgraphs (Q753842) (← links)
- On a packing problem for infinite graphs and independence spaces (Q754225) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- Bounds on path connectivity (Q761468) (← links)
- On hamiltonian line graphs and connectivity (Q803154) (← links)
- Label-connected graphs and the gossip problem (Q804593) (← links)
- Source location with rigidity and tree packing requirements (Q867918) (← links)
- On \(k\)-planar crossing numbers (Q885282) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- Pin-collinear body-and-pin frameworks and the molecular conjecture (Q958222) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- Covering planar graphs with forests, one having bounded maximum degree (Q1003834) (← links)
- Balanced decompositions of a signed graph (Q1092068) (← links)
- Edge-packings of graphs and network reliability (Q1111461) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- On the spanning tree polyhedron (Q1122482) (← links)
- The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests (Q1132898) (← links)
- 2-linked graphs (Q1150633) (← links)
- Two packing problems on \(k\)-matroid trees (Q1178033) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Linking \((n-2)\)-dimensional panels in \(n\)-space. I: \((k-1,k)\)-graphs and \((k-1,k)\)-frames (Q1180441) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties (Q1204467) (← links)
- Duality in graph families (Q1208357) (← links)
- Nowhere-zero 3-flows of highly connected graphs (Q1208358) (← links)
- Fractional arboricity, strength, and principal partitions in graphs and matroids (Q1208447) (← links)
- Edge-disjoint spanning trees and depth-first search (Q1217713) (← links)
- On maximally distant spanning trees of a graph (Q1229218) (← links)
- Edge-disjoint branching in directed multigraphs (Q1255784) (← links)
- On packing connectors (Q1272488) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- Arboricity and complement of a graph (Q1299859) (← links)
- A short proof of Nash-Williams' theorem for the arboricity of a graph (Q1323488) (← links)
- Arboricity and bipartite subgraph listing algorithms (Q1334644) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Edge-disjoint trees containing some given vertices in a graph (Q1405100) (← links)
- Antisymmetric flows and edge-connectivity (Q1422419) (← links)
- A linking polynomial of two matroids (Q1433013) (← links)
- Applications of matroid partition to tree decomposition (Q1568255) (← links)
- An algorithm for packing connectors (Q1569028) (← links)
- The connectivity of acyclic orientation graphs (Q1584217) (← links)
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
- Covering planar graphs with forests (Q1775897) (← links)
- Shannon switching games without terminals. II (Q1812789) (← links)
- Edge disjoint spanning trees in random graphs (Q1814020) (← links)
- Variations on a game (Q1836601) (← links)
- Connectivity and edge-disjoint spanning trees (Q1837196) (← links)
- Bounds of the number of disjoint spanning trees (Q1844855) (← links)