Kitty Meeks ; Dominik K. Vu - Extremal properties of flood-filling games

dmtcs:4412 - Discrete Mathematics & Theoretical Computer Science, July 30, 2019, vol. 21 no. 4 -
Extremal properties of flood-filling gamesArticle

Authors: Kitty Meeks ; Dominik K. Vu

    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.

    Volume: vol. 21 no. 4
    Section: Graph Theory
    Published on: July 30, 2019
    Accepted on: July 3, 2019
    Submitted on: March 29, 2018
    Keywords: Mathematics - Combinatorics,Computer Science - Discrete Mathematics

    Consultation statistics

    This page has been seen 966 times.
    This article's PDF has been downloaded 224 times.