research
∙
07/27/2023
3-Coloring C_4 or C_3-free Diameter Two Graphs
The question of whether 3-Coloring can be solved in polynomial-time for ...
share
research
∙
07/16/2021
On Vizing's edge colouring question
Soon after his 1964 seminal paper on edge colouring, Vizing asked the fo...
research
∙
11/12/2020
Note on 3-Coloring of (2P_4,C_5)-Free Graphs
We show that the 3-coloring problem is polynomial-time solvable on (2P_4...
research
∙
03/27/2020
Covering minimal separators and potential maximal cliques in P_t-free graphs
A graph is called P_t-free if it does not contain a t-vertex path as an ...
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
∙
03/09/2018
