On the Problem of Decomposing a Graph into n Connected Factors
From MaRDI portal
Publication:3275433
DOI10.1112/jlms/s1-36.1.221zbMath0096.38001WikidataQ105584980 ScholiaQ105584980MaRDI QIDQ3275433
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.221
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Blocking and anti-blocking pairs of polyhedra, On the higher-order edge toughness of a graph, Submodular functions in graph theory, Bidirectional retracting-free double tracings and upper embeddability of graphs, 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, A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae, On hamiltonian line graphs and connectivity, Label-connected graphs and the gossip problem, Source location with rigidity and tree packing requirements, Graph factors and factorization: 1985--2003: a survey, 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, 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, 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, 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, Partitions of complete geometric graphs into plane trees, 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, Graphs with forbidden subgraphs, 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, A linear programming approach to increasing the weight of all minimum spanning trees, Unnamed Item, Unnamed Item, Transversal matroid intersections and related packings, Unnamed Item
