Spanning trees and the complexity of flood-filling games

DOI10.1007/s00224-013-9482-zzbMath1303.05127arXiv1203.2538MaRDI QIDQ489766

Kitty Meeks, Alexander D. Scott

Publication date: 21 January 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.2538

zbMATH Keywords

computational complexity; graph colouring; games on graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91A43: Games involving graphs

05C15: Coloring of graphs and hypergraphs

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