Edge-Disjoint Spanning Trees of Finite Graphs

Cited in

(only showing first 100 items - show all)

Covering planar graphs with forests, one having bounded maximum degree
Edge-decompositions of highly connected graphs into paths
Sparse hypergraphs and pebble game algorithms
On the rigidity of molecular graphs
Balanced decompositions of a signed graph
Edge-packings of graphs and network reliability
Planar graphs and poset dimension
On the spanning tree polyhedron
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests
2-linked graphs
Two packing problems on \(k\)-matroid trees
Planar orientations with low out-degree and compaction of adjacency matrices
Linking \((n-2)\)-dimensional panels in \(n\)-space. I: \((k-1,k)\)-graphs and \((k-1,k)\)-frames
Forests, frames, and games: Algorithms for matroid sums and applications
Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
Duality in graph families
Nowhere-zero 3-flows of highly connected graphs
Fractional arboricity, strength, and principal partitions in graphs and matroids
Edge-disjoint spanning trees and depth-first search
On maximally distant spanning trees of a graph
Edge-disjoint branching in directed multigraphs
On packing connectors
Random sampling and greedy sparsification for matroid optimization problems
Arboricity and complement of a graph
A short proof of Nash-Williams' theorem for the arboricity of a graph
Arboricity and bipartite subgraph listing algorithms
Efficient computation of implicit representations of sparse graphs
Simple planar graph partition into three forests
Edge-disjoint trees containing some given vertices in a graph
Antisymmetric flows and edge-connectivity
A linking polynomial of two matroids
Applications of matroid partition to tree decomposition
An algorithm for packing connectors
The connectivity of acyclic orientation graphs
Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
Packing spanning trees in highly essentially connected graphs
Extensions of matroid covering and packing
Decomposing 4-connected planar triangulations into two trees and one path
Algorithms for detecting dependencies and rigid subsystems for CAD
Completely independent spanning trees in k-th power of graphs
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs
Packing arborescences in random digraphs
The parity Hamiltonian cycle problem
Fast approximation of matroid packing and covering
Generalized arboricity of graphs with large girth
Collapsible subgraphs of a 4-edge-connected graph
Graphs without proper subgraphs of minimum degree 3 and short cycles
Combinatorial rigidity of incidence systems and application to dictionary learning
An enhancement of Nash-Williams' theorem on edge arboricity of graphs
Decomposing highly connected graphs into paths of length five
Edge-disjoint spanning trees and the number of maximum state circles of a graph
Steiner tree packing number and tree connectivity
Every 3-connected essentially 10-connected line graph is Hamilton-connected
Covering planar graphs with forests
Subgraph polytopes and independence polytopes of count matroids
Shannon switching games without terminals. II
Edge disjoint spanning trees in random graphs
Variations on a game
Connectivity and edge-disjoint spanning trees
Bounds of the number of disjoint spanning trees
Contractible subgraphs in 3-connected graphs
All 4-connected line graphs of claw free graphs are Hamiltonian connected
Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs
A note on biased and non-biased games
On two-connected subgraph polytopes
Hitting time for \(k\) edge-disjoint spanning trees in a random graph
Disjoint compatible geometric matchings
Sufficient conditions for protection routing in IP networks
Matrix choosability
The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
Antiparallel \(d\)-stable traces and a stronger version of ore problem
Edge-disjoint spanning trees and forests of graphs
Game edge-connectivity of graphs
Spectral conditions for graph rigidity in the Euclidean plane
Rainbow monochromatic \(k\)-edge-connection colorings of graphs
The region smoothing swap game
Assur decompositions of direction-length frameworks
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
Covering projective planar graphs with three forests
Distributed backup placement
Spanning tree packing and 2-essential edge-connectivity
On some algorithmic aspects of hypergraphic matroids
Globally balancing spanning trees
Globally rigid powers of graphs
On the s-hamiltonianicity of an hourglass-free line graph
Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
Sublinear-time distributed algorithms for detecting small cliques and even cycles
Extremal graphs for a spectral inequality on edge-disjoint spanning trees
Strengthened Ore conditions for (s, t)-supereulerian graphs
A Hamilton sufficient condition for completely independent spanning tree
Colouring planar graphs with bounded monochromatic components
\(\ell^1\) and \(\ell^\infty\) plane
On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity
Circular flows via extended Tutte orientations
Packing plane spanning trees into a point set
On \(( s , t )\)-supereulerian graphs with linear degree bounds
An analogue of Edmonds' branching theorem for infinite digraphs
Toughness in pseudo-random graphs
Connectivity for quantum graphs
The minimum size of a graph with given tree connectivity

This page was built for publication: Edge-Disjoint Spanning Trees of Finite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3286077)