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
Fully dynamic MIS in uniformly sparse graphs
Krzysztof Onak,Baruch Schieber,Shay Solomon,Nicole Wein +3 more
- 01 Jul 2018
TL;DR: For graphs with arboricity α, the amortized update time of as discussed by the authors is O(α 2 ⋅ log 2 n, where n is the number of vertices.
14
Brick partitions of graphs
Bill Jackson,Tibor Jordán +1 more
TL;DR: It is shown that the vertex sets of the q-bricks of G partition the vertex set of G, and that the graph obtained from H by replacing each edge by c parallel edges form a refinement of this partition.
14
Network design game with both reliability and security failures
Galina Schwartz,Saurabh Amin,Assane Gueye,Jean Walrand +3 more
- 01 Sep 2011
TL;DR: In presence of the aforementioned information deficiencies, reliability and security are interdependent, and it is argued that defenders (managers) should co-design their defenses against faults and attacks.
14
Edge disjoint spanning trees in random graphs
Alan Frieze,Tomasz Łuczak +1 more
TL;DR: In this paper, the maximum number of edge disjoint spanning trees contained in the random graph G = G is shown to be at most 1, where G is obtained by ignoring orientation but without coalescing edges.
14
Orientations of infinite graphs with prescribed edge-connectivity
TL;DR: A decomposition result for locally finite graphs is proved which can be used to extend results on edge-connectivity from finite to infinite graphs.