research
∙
06/04/2020
List-three-coloring P_t-free graphs with no induced 1-subdivision of K_1,s
Let s and t be positive integers. We use P_t to denote the path with t v...
share
research
∙
05/04/2020
Complexity of C_k-coloring in hereditary classes of graphs
For a graph F, a graph G is F-free if it does not contain an induced sub...
research
∙
02/07/2018
Four-coloring P_6-free graphs. II. Finding an excellent precoloring
This is the second paper in a series of two. The goal of the series is t...
research
∙
02/07/2018