\textsc{polish} -- Let us play the cleaning game

DOI10.1016/j.tcs.2012.05.014zbMath1258.91043OpenAlexW1994325523MaRDI QIDQ1929225

Przemysław Gordinowicz, Richard J. Nowakowski, Paweł Prałat

Publication date: 7 January 2013

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

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

zbMATH Keywords

combinatorial gamechip firingbrush numberimpartial gamenimcleaning game

Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial games (91A46)

Related Items (4)

Game brush number ⋮ Brushing with additional cleaning restrictions ⋮ Brushing without capacity restrictions ⋮ Elimination schemes and lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice point methods for combinatorial games
• Cleaning with brooms
• Cleaning random \(d\)-regular graphs with brooms
• Chip-firing games on graphs
• Cleaning a network with brushes
• An annotated bibliography on guaranteed graph searching
• Parallel cleaning of a network with brushes
• Clean the graph before you draw it!
• Balanced vertex-orderings of graphs
• Cleaning Regular Graphs with Brushes
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

This page was built for publication: \textsc{polish} -- Let us play the cleaning game