
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

Finding large Hcolorable subgraphs in hereditary graph classes
We study the Max Partial HColoring problem: given a graph G, find the l...
read it

Entropic matroids and their representation
This paper investigates entropic matroids, that is, matroids whose rank ...
read it

Disproportionate division
We study the disproportionate version of the classical cakecutting prob...
read it

Caterpillars in ErdősHajnal
Let T be a tree such that all its vertices of degree more than two lie o...
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
Sophie Spirkl
is this you? claim profile