The question of whether 3-Coloring can be solved in polynomial-time for ...
Soon after his 1964 seminal paper on edge colouring, Vizing asked the
fo...
We show that the 3-coloring problem is polynomial-time solvable on
(2P_4...
A graph is called P_t-free if it does not contain a t-vertex path as an
...
The k-Colouring problem is to decide if the vertices of a graph can be
c...
The Barat-Thomassen conjecture, recently proved in [Bensmail et al.: A p...