Abu-Khzam, Faisal N.; Feghali, Carl; Heggernes, Pinar
(2018-04-26)
Let G = (V, E) be a connected 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, ...