Partitioning a graph into degenerate subgraphs
نویسندگان
چکیده
Let G = (V,E) be a graph with maximum degree k ≥ 3 distinct from Kk+1. Given integers s ≥ 2 and p1, . . . , ps ≥ 0, G is said to be (p1, . . . , ps)-partitionable if there exists a partition of V into sets V1, . . . , Vs such that G[Vi] is pi-degenerate for i ∈ {1, . . . , s}. In this paper, we prove that we can find a (p1, . . . , ps)-partition of G in O(|V |+|E|)-time whenever 1 ≥ p1, . . . , ps ≥ 0 and p1+· · ·+ps ≥ k−s. This generalizes a result of Bonamy et al. (MFCS, 2017) and can be viewed as an algorithmic extension of Brooks’ theorem and several results on vertex arboricity of graphs of bounded maximum degree. We also prove that deciding whether G is (p, q)-partitionable is NPcomplete for every k ≥ 5 and pairs of non-negative integers (p, q) such that (p, q) 6= (1, 1) and p+q = k−3. This resolves an open problem of Bonamy et al. (manuscript, 2017). Combined with results of Borodin, Kostochka and Toft (Discrete Mathematics, 2000), Yang and Yuan (Discrete Mathematics, 2006) and Wu, Yuan and Zhao (Journal of Mathematical Study, 1996), it also completely settles the complexity of deciding whether a graph with bounded maximum degree can be partitioned into two subgraphs of prescribed degeneracy.
منابع مشابه
Partitioning Generic Graphs into K Balanced Subgraphs
Graph partitioning is a classical graph theory problem that has proven to be NP-hard. Most of the research in literature has focused its attention on a particular case of the problem called the graph bisection problem, where k = 2, such that the parts have approximately equal weight and minimizing the size of the edge cut. In this article, we describe how to obtain balanced partitioning on a gi...
متن کاملRNA Graph Partitioning for the Discovery of RNA Modularity: A Novel Application of Graph Partition Algorithm to Biology
Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG) framework, we represent RNA...
متن کاملPartitioning the Edges of a Planar Graph into Two Partial K-Trees
In this paper we prove two results on partitioning the edges of a planar graph into two partial k-trees, for fixed values of k. Interest in this class of partitioning problems arises since many intractable graph and network problems admit polynomial time solutions on k-trees and their subgraphs (partial k-trees). The first result shows that every planar graph is a union of two partial 3-trees. ...
متن کاملPartitioning A Chordal Graph Into Transitive Subgraphs For Parallel Sparse Triangular Solution
متن کامل
On partitioning interval graphs into proper interval subgraphs and related problems
In this paper, we establish that any interval graph (resp. circular-arc graph) with n vertices admits a partition into at most ⌈log3 n⌉ (resp. ⌈log3 n⌉+1) proper interval subgraphs, for n > 1. The proof is constructive and provides an efficient algorithm to compute such a partition. On the other hand, this bound is shown to be asymptotically sharp for an infinite family of interval graphs. In a...
متن کامل