27 citations · 100 across the 27 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.CC2011
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
Kitty Meeks, Alexander Scott
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…
cs.DS2011★ 18 cited
The complexity of flood-filling games on graphs
Kitty Meeks, Alexander Scott
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…
cs.DS2011★ 17 cited
The complexity of Free-Flood-It on 2xn boards
Kitty Meeks, Alexander Scott
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…