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
•Posted Content
Testing bounded arboricity
Talya Eden,Reut Levi,Dana Ron +2 more
TL;DR: In this paper, the authors consider the problem of testing whether a graph has bounded arboricity in the sparse-graphs model, and present a tolerant tester in this model.
2
Spanning cycles in regular matroids without small cocircuits
TL;DR: It is proved that for a connected simple regular matroid M, if for any cocircuit D, |D|>=max{r(M)-45,6}, then M has a spanning cycle.
2
FPT algorithms for packing <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e150" altimg="si23.svg"><mml:mi>k</mml:mi></mml:math>-safe spanning rooted sub(di)graphs
Stéphane Bessy,Florian Hörsch,Ana Karolinna Maia,Dieter Rautenbach,Ignasi Sau +4 more
TL;DR: This paper develops FPT algorithms for packing k-safe spanning rooted sub(di)graphs, including arc-disjoint arborescences, flow branchings, and edge-disjoint spanning trees, improving on existing XP algorithms and answering a question of Bang-Jensen et al. (2016).
2
Failure Localization Via a Central Controller
Janos Tapolcai,Pin-Han Ho,Peter Babarczi,Lajos Rónyai +3 more
- 01 Jan 2015
TL;DR: The chapter is on the m-trail allocation problem by introducing algorithms and approaches in presence of single and multiple link failures, respectively, including Random Code Swapping (RCA–RCS) for single-link failures, and a suite of heuristics for general topologies.
2
Complexity of minimal tree routing and coloring
Xujin Chen,Xiaodong Hu,Xiaohua Jia +2 more
- 22 Jun 2005
TL;DR: This paper first proves Ω(g1−e)-inapproximability of the problem even when G is a mesh, and then proposes some approximation algorithms with provable performance guarantees for general graphs and some special graphs as well.
2