Colouring (P_r+P_s)-Free Graphs

29 Jun 2018 Klimošová Tereza Malík Josef Masařík Tomáš Novotná Jana Paulusma Daniël Slívová Veronika

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 alike. If each vertex u must be assigned a colour from a prescribed list $L(u) \subseteq \{1,\cdots, k\}$, then we obtain the List $k$-Colouring problem... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • COMPUTATIONAL COMPLEXITY