
Listthreecoloring P_tfree graphs with no induced 1subdivision of K_1,s
Let s and t be positive integers. We use P_t to denote the path with t v...
read it

Complexity of C_kcoloring in hereditary classes of graphs
For a graph F, a graph G is Ffree if it does not contain an induced sub...
read it

Fourcoloring P_6free graphs. II. Finding an excellent precoloring
This is the second paper in a series of two. The goal of the series is t...
read it

Fourcoloring P_6free graphs. I. Extending an excellent precoloring
This is the first paper in a series whose goal is to give a polynomial t...
read it
Mingxian Zhong
is this you? claim profile