Partitioning a graph into degenerate subgraphs

Abstract

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 NP-complete for every k≥5 and pairs of non-negative integers (p,q) such that (p,q)≠(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 (\emph{Discrete Mathematics}, 2000), Yang and Yuan (\emph{Discrete Mathematics}, 2006) and Wu, Yuan and Zhao (\emph{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.