On Colouring (2P_2,H)-Free and (P_5,H)-Free Graphs

12/06/2017
by   Konrad Dabrowski, et al.
0

The Colouring problem asks whether the vertices of a graph can be coloured with at most k colours for a given integer k in such a way that no two adjacent vertices receive the same colour. A graph is (H_1,H_2)-free if it has no induced subgraph isomorphic to H_1 or H_2. A connected graph H_1 is almost classified if Colouring on (H_1,H_2)-free graphs is known to be polynomial-time solvable or NP-complete for all but finitely many connected graphs H_2. We show that every connected graph H_1 apart from the claw K_1,3 and the 5-vertex path P_5 is almost classified. We also prove a number of new hardness results for Colouring on (2P_2,H)-free graphs. This enables us to list all graphs H for which the complexity of Colouring is open on (2P_2,H)-free graphs and all graphs H for which the complexity of Colouring is open on (P_5,H)-free graphs. In fact we show that these two lists coincide. Moreover, we show that the complexities of Colouring for (2P_2,H)-free graphs and for (P_5,H)-free graphs are the same for all known cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2018

Colouring (P_r+P_s)-Free Graphs

The k-Colouring problem is to decide if the vertices of a graph can be c...
research
01/30/2023

Cops and robbers on P_5-free graphs

We prove that every connected P_5-free graph has cop number at most two,...
research
05/12/2020

List homomorphism problems for signed graphs

We consider homomorphisms of signed graphs from a computational perspect...
research
02/08/2011

Graph Coalition Structure Generation

We give the first analysis of the computational complexity of coalition...
research
10/15/2018

Dynamic Connected Cooperative Coverage Problem

We study the so-called dynamic coverage problem by agents located in som...
research
07/22/2016

Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide

A graph is (H_1,H_2)-free for a pair of graphs H_1,H_2 if it contains no...
research
12/09/2022

A refinement on the structure of vertex-critical (P_5, gem)-free graphs

We give a new, stronger proof that there are only finitely many k-vertex...

Please sign up or login with your details

Forgot password? Click here to reset