Edge-Disjoint Spanning Trees of Finite Graphs

DOI10.1112/jlms/s1-36.1.445zbMath0102.38805WikidataQ29027917 ScholiaQ29027917MaRDI QIDQ3286077

Publication date: 1961

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-36.1.445

zbMATH Keywords

topology

Related Items

Unnamed Item, Unnamed Item, On the computational complexity of ordered subgraph recognition, Unnamed Item, An orientation theorem with parity conditions, On the higher-order edge toughness of a graph, Covering weighted graphs by even subgraphs, On a packing problem for infinite graphs and independence spaces, Structural theorems for submodular functions, polymatroids and polymatroid intersections, Bounds on path connectivity, On hamiltonian line graphs and connectivity, Label-connected graphs and the gossip problem, Source location with rigidity and tree packing requirements, On \(k\)-planar crossing numbers, Inapproximability and approximability of minimal tree routing and coloring, Pin-collinear body-and-pin frameworks and the molecular conjecture, Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs, Covering planar graphs with forests, one having bounded maximum degree, 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, Covering planar graphs with forests, 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, Matrix choosability, Homomorphism bounded classes of graphs, Edge vulnerability parameters of split graphs, Avoider-Enforcer games, Separation of partition inequalities with terminals, Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors, Matching edges and faces in polygonal partitions, Pebble game algorithms and sparse graphs, Arboricity and tree-packing in locally finite graphs, The characterization of sufficient visibility in the direct reference plane approach for multiple views with missing data, Edge vulnerability parameters of bisplit graphs, The point-arboricity of a graph, Generalized Ramsey theory for graphs. I: Diagonal numbers, On flows in bidirected graphs, On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs, Network reinforcement, Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures, Connected (g, f)-factors, On some arboricities in planar graphs, An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem, A linear programming approach to increasing the weight of all minimum spanning trees, Unnamed Item, Unnamed Item, Unnamed Item