The problem of determining the number of "flooding operations" required to make a given coloured graph monochromatic in the one-player combinatorial game Flood-It has been studied extensively from an algorithmic point of view, but basic questions about the maximum number of moves that might be required in the worst case remain unanswered. We begin a systematic investigation of such questions, with the goal of determining, for a given graph, the maximum number of moves that may be required, taken over all possible colourings. We give several upper and lower bounds on this quantity for arbitrary graphs and show that all of the bounds are tight for trees; we also investigate how much the upper bounds can be improved if we restrict our attention to graphs with higher edge-density.

Source : oai:arXiv.org:1504.00596

DOI : 10.23638/DMTCS-21-4-11

Volume: vol. 21 no. 4

Section: Graph Theory

Published on: July 30, 2019

Submitted on: March 29, 2018

Keywords: Mathematics - Combinatorics,Computer Science - Discrete Mathematics

This page has been seen 489 times.

This article's PDF has been downloaded 48 times.