The complexity of free-flood-it on \(2\times n\) boards

DOI10.1016/j.tcs.2013.06.010zbMath1301.05227MaRDI QIDQ388453

Kitty Meeks, Alexander D. Scott

Publication date: 19 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.010

zbMATH Keywords

computational complexity; fixed parameter tractability; graph colouring

Mathematics Subject Classification ID

91A43: Games involving graphs

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C57: Games on graphs (graph-theoretic aspects)