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
Peer Review
Steiner Type Packing Problems in Digraphs: A Survey
Yuefang Sun
- 24 Jun 2022
TL;DR: A survey of Steiner type packing problems in digraphs can be found in this paper , where the authors present a number of conjectures and open problems for further study, e.g., strong subgraph packing, strong arc decomposition, arc disjoint cycles containing given vertices.
Spanning subgraph with Eulerian components
TL;DR: It is proved that if G is a connected graph with F(G)@?k, then either G is k-supereulerian or G can be contracted to a tree of order k+1.
•Posted Content
Packing Plane Perfect Matchings into a Point Set
TL;DR: The lower bound of ⌊log2$n$⌋-1$-1 is proved for points in general position and for some special configurations of point sets.
Minimum k-way cuts via deterministic greedy tree packing
Mikkel Thorup
- 17 May 2008
TL;DR: A simple and fast deterministic algorithm for the minimum k-way cut problem in a capacitated graph, that is, finding a set of edges with minimum total capacity whose removal splits the graph into at least k components, which essentially match the O(n(2-o(1))k) running time of the Monto Carlo (no correctness guarantee) randomized algorithm of Karger and Stein.
Faster Algorithms for Security Games on Matroids
Mourad Baïou,Francisco Barahona +1 more
TL;DR: A strongly polynomial algorithm to compute Nash-equilibrium mixed strategies for graphic matroids, settling a question that was left open in Szeszlér (2016).