We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that List Edge Chromatic Number and List Total Chromaticâ€¦ (More)

We introduce a family of parameterised counting problems on graphs, p-#Induced Subgraph With Property(Î¦), which generalises a number of problems which have previously been studied. This paperâ€¦ (More)

We introduce a variant of the well-studied sum choice number of graphs, which we call the interactive sum choice number. In this variant, we request colours to be added to the verticesâ€™ colour-listsâ€¦ (More)

We consider the complexity of problems related to the combinatorial game Free-Flood-It, in which players aim to make a coloured graph monochromatic with the minimum possible number of floodingâ€¦ (More)

We consider the problem of counting, in a given graph, the number of induced k-vertex subgraphs which have an even number of edges, and also the complementary problem of counting the k-vertex inducedâ€¦ (More)

Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent progress in this area. Many of theâ€¦ (More)

We consider parameterized subgraph counting problems of the following form: given a graph G, how many k-tuples of its vertices induce a subgraph with a given property? A number of such problems areâ€¦ (More)

Motivated by applications in network epidemiology, we consider the problem of determining whether it is possible to delete at most k edges from a given input graph (of small treewidth) so that theâ€¦ (More)