Log In Sign Up

Finding a Small Number of Colourful Components

by   Laurent Bulteau, et al.

A partition (V_1,...,V_k) of the vertex set of a graph G with a (not necessarily proper) colouring c is colourful if no two vertices in any V_i have the same colour and every set V_i induces a connected graph. The COLOURFUL PARTITION problem is to decide whether a coloured graph (G,c) has a colourful partition of size at most k. This problem is closely related to the COLOURFUL COMPONENTS problem, which is to decide whether a graph can be modified into a graph whose connected components form a colourful partition by deleting at most p edges. Nevertheless we show that COLOURFUL PARTITION and COLOURFUL COMPONENTS may have different complexities for restricted instances. We tighten known NP-hardness results for both problems and in addition we prove new hardness and tractability results for COLOURFUL PARTITION. Using these results we complete our paper with a thorough parameterized study of COLOURFUL PARTITION.


page 1

page 2

page 3

page 4


Strongly connected components-Algorithm for finding the strongly connected components of a graph

A directed graph G (V, E) is strongly connected if and only if, for a pa...

Gerrymandering: A Briber's Perspective

We initiate the study of bribery problem in the context of gerrymanderin...

Parameterized Complexity of Graph Partitioning into Connected Clusters

Given an undirected graph G and q integers n_1,n_2,n_3, ⋯, n_q, balanced...

Partitioning sparse graphs into an independent set and a graph with bounded size components

We study the problem of partitioning the vertex set of a given graph so ...

Modularity and edge sampling

Suppose that there is an unknown underlying graph G on a large vertex se...

Inheritance of Convexity for the 𝒫̃_min-Restricted Game

We consider a restricted game on weighted graphs associated with minimum...

Learning Graph Partitions

Given a partition of a graph into connected components, the membership o...