Edge-Disjoint Spanning Trees of Finite Graphs
From MaRDI portal
Publication:3286077
DOI10.1112/jlms/s1-36.1.445zbMath0102.38805OpenAlexW2042706982WikidataQ29027917 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
Related Items (only showing first 100 items - show all)
On the first-order edge tenacity of a graph ⋮ Packing Steiner trees ⋮ Arboricity and bipartite subgraph listing algorithms ⋮ A note on edge-disjoint Hamilton cycles in line graphs ⋮ An inductive construction of minimally rigid body-hinge simple graphs ⋮ Balanced decompositions of a signed graph ⋮ Extended formulations for sparsity matroids ⋮ Fast approximation for computing the fractional arboricity and extraction of communities of a graph ⋮ Fractional spanning tree packing, forest covering and eigenvalues ⋮ Graphs with large generalized (edge-)connectivity ⋮ Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Edge-packings of graphs and network reliability ⋮ Source location with rigidity and tree packing requirements ⋮ Efficient computation of implicit representations of sparse graphs ⋮ Planar graphs and poset dimension ⋮ On the spanning tree polyhedron ⋮ Packing Steiner trees on four terminals ⋮ On \(k\)-planar crossing numbers ⋮ The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests ⋮ On 1-Hamilton-connected claw-free graphs ⋮ Bounding tree-width via contraction on the projective plane and torus ⋮ Global maker-breaker games on sparse graphs ⋮ A minimum degree condition forcing complete graph immersion ⋮ Simple planar graph partition into three forests ⋮ Packing of rigid spanning subgraphs and spanning trees ⋮ On spanning tree packings of highly edge connected graphs ⋮ Edge-decomposition of graphs into copies of a tree with four edges ⋮ Ore's condition for completely independent spanning trees ⋮ Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Cycle double covers and the semi-Kotzig frame ⋮ Hamilton cycles in 5-connected line graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Cyclic orderings and cyclic arboricity of matroids ⋮ A short proof of the tree-packing theorem ⋮ Edge-disjoint trees containing some given vertices in a graph ⋮ 2-linked graphs ⋮ Edge-disjoint spanning trees and eigenvalues of regular graphs ⋮ Spectral conditions for edge connectivity and packing spanning trees in multigraphs ⋮ Generic global rigidity of body-hinge frameworks ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Highly connected molecular graphs are rigid in three dimensions ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Spanning cycles in regular matroids without small cocircuits ⋮ Antisymmetric flows and edge-connectivity ⋮ Circular flow on signed graphs ⋮ Colouring edges with many colours in cycles ⋮ Decomposing a graph into bistars ⋮ Compatible geometric matchings ⋮ Lusternik-Schnirelmann category for simplicial complexes ⋮ A linking polynomial of two matroids ⋮ On the tractability of some natural packing, covering and partitioning problems ⋮ Spanning trees: A survey ⋮ How many conjectures can you stand? A survey ⋮ Two packing problems on \(k\)-matroid trees ⋮ Planar orientations with low out-degree and compaction of adjacency matrices ⋮ Inapproximability and approximability of minimal tree routing and coloring ⋮ Linking \((n-2)\)-dimensional panels in \(n\)-space. I: \((k-1,k)\)-graphs and \((k-1,k)\)-frames ⋮ Faster algorithms for security games on matroids ⋮ Characterizations of strength extremal graphs ⋮ Periodic rigidity on a variable torus using inductive constructions ⋮ A faster algorithm for packing branchings in digraphs ⋮ Forests, frames, and games: Algorithms for matroid sums and applications ⋮ On the higher-order edge toughness of a graph ⋮ Pin-collinear body-and-pin frameworks and the molecular conjecture ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ Brick partitions of graphs ⋮ Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties ⋮ A rooted-forest partition with uniform vertex demand ⋮ The generic rank of body-bar-and-hinge frameworks ⋮ Duality in graph families ⋮ Nowhere-zero 3-flows of highly connected graphs ⋮ Fractional arboricity, strength, and principal partitions in graphs and matroids ⋮ A proof of the molecular conjecture ⋮ Bounded direction-length frameworks ⋮ Edge-disjoint spanning trees and depth-first search ⋮ What is on his mind? ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid ⋮ On maximally distant spanning trees of a graph ⋮ Eisenberg-Gale markets: algorithms and game-theoretic properties ⋮ Covering planar graphs with forests, one having bounded maximum degree ⋮ Edge-disjoint branching in directed multigraphs ⋮ Branch-and-cut approaches for chance-constrained formulations of reliable network design problems ⋮ 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 ⋮ On packing connectors ⋮ Bounds on path connectivity ⋮ Spanning subgraph with Eulerian components ⋮ Packing of Steiner trees and \(S\)-connectors in graphs ⋮ Edge-decompositions of highly connected graphs into paths ⋮ Random sampling and greedy sparsification for matroid optimization problems ⋮ Sparse hypergraphs and pebble game algorithms ⋮ On the rigidity of molecular graphs ⋮ Arboricity and complement of a graph ⋮ On hamiltonian line graphs and connectivity ⋮ Label-connected graphs and the gossip problem ⋮ A short proof of Nash-Williams' theorem for the arboricity of a graph
This page was built for publication: Edge-Disjoint Spanning Trees of Finite Graphs
