On the Problem of Decomposing a Graph into n Connected Factors

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
Sparsity-certifying graph decompositions
On the rigidity of molecular graphs
Rigidity of multi-graphs. I: Linking rigid bodies in n-space
Path-connectivity in graphs
Balanced decompositions of a signed graph
Edge-packings of graphs and network reliability
Generalized polymatroids and submodular flows
On the spanning tree polyhedron
On the orientation of graphs
2-linked graphs
The complexity of controlled selection
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
Edge-disjoint trees containing some given vertices in a graph
Constructive characterizations for packing and covering with trees
On decomposing a hypergraph into \(k\) connected sub-hypergraphs
Combined connectivity augmentation and orientation problems
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
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
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
Fast approximation of matroid packing and covering
Collapsible subgraphs of a 4-edge-connected graph
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
Blocking optimal structures
Steiner tree packing number and tree connectivity
Every 3-connected essentially 10-connected line graph is Hamilton-connected
Covering planar graphs with forests
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
Hitting time for \(k\) edge-disjoint spanning trees in a random graph
Disjoint compatible geometric matchings
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
Covering projective planar graphs with three forests
Complexity of some arc-partition problems for digraphs
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
Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
Extremal graphs for a spectral inequality on edge-disjoint spanning trees
Strengthened Ore conditions for (s, t)-supereulerian graphs
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
Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
Polynomially determine if a graph is \((s,3)\)-supereulerian
On the notion of generalized minor in topological network theory and matroids
Note on edge-disjoint spanning trees and eigenvalues
Extremal infinite graph theory
Monochromatic \(k\)-edge-connection colorings of graphs
Network strength games: the core and the nucleolus
Group connectivity and group coloring: small groups versus large groups
Spanning tree packing number and eigenvalues of graphs with given girth
Orientations and detachments of graphs with prescribed degrees and connectivity
Decomposition into two trees with orientation constraints
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
Degree sequence realizations with given packing and covering of spanning trees
Spanning trees and spanning Eulerian subgraphs with small degrees
Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs

This page was built for publication: On the Problem of Decomposing a Graph into n Connected Factors

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