Journal Article10.1112/JLMS/S1-36.1.221
On the Problem of Decomposing a Graph into n Connected Factors
792
About: This article is published in Journal of The London Mathematical Society-second Series. The article was published on 01 Jan 1961. The article focuses on the topics: k-vertex-connected graph & Connected component.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Disjoint compatible geometric matchings
Mashhood Ishaque,Diane L. Souvaine,Csaba D. Tóth +2 more
- 13 Jun 2011
TL;DR: The key tool in the proof is a novel subdivision of the free space around n disjoint line segments into at most n+1 convex cells such that the dual graph of the subdivision contains two edge-disjoint spanning trees.
On a packing problem for infinite graphs and independence spaces
TL;DR: A counterexample is given to a conjecture of Nash-Williams on edge-disjoint spanning trees of countable graphs, and a sufficient condition is proved for the packing problem in independence spaces over a countably infinite set.
15
Cyclic orderings and cyclic arboricity of matroids
TL;DR: A general result concerning cyclic orderings of the elements of a matroid is proved, for each matroid M, weight function@w:E(M)->N, and positive integer D, are equivalent.
15
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
Jiaao Li,Hong-Jian Lai,Rong Luo +2 more
TL;DR: It is shown that a graph G is strongly $\mathbb Z_m$-connected if and only if $(m-2)G$ is strongly 𝕂(v)G, which is the graph obtained from G by replacing each edge in $G$ with $m- 2$ parallel edges.
15
A constructive characterisation of circuits in the simple (2,2)-sparsity matroid
TL;DR: In this article, a constructive characterisation of circuits in the simple (2, 2)-sparsity matroid is provided, where the Henneberg 2 operation is adequate only when the graph is sufficiently connected.
15