@article{LNT14,
title = "Flooding games on graphs ",
journal = "Discrete Applied Mathematics ",
volume = "164, Part 2",
number = "0",
pages = "532 - 538",
year = "2014",
note = "LAGOS’11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina — 2011 ",
issn = "0166-218X",
doi = "http://dx.doi.org/10.1016/j.dam.2013.09.024",
url = "http://www.sciencedirect.com/science/article/pii/S0166218X13004290",
author = "A. Lagoutte and M. Noual and E. Thierry",
keywords = "Combinatorial puzzle",
keywords = "Colored graph",
keywords = "Neighborhood contraction "
}

