Colouring $(P_r+P_s)$-Free Graphs

Tereza Klimošová, Josef Malík, Tomáš Masařík +3

The $k$-Colouring problem is to decide if the vertices of a graph can be coloured with at most $k$ colours for a fixed integer $k$ such that no two adjacent vertices are coloured a…