Cleaning with brooms

DOI10.1007/s00373-010-0965-2zbMath1235.05094OpenAlexW2091551894MaRDI QIDQ659685

Richard J. Nowakowski, Margaret-Ellen Messinger, Paweł Prałat

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0965-2

zbMATH Keywords

chip-firing gamebrush numbergraph searchingbroom numbergraph cleaning

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (7)

Game brush number ⋮ Brushing with additional cleaning restrictions ⋮ \textsc{polish} -- Let us play the cleaning game ⋮ Brushing without capacity restrictions ⋮ Cleaning random \(d\)-regular graphs with brooms ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Parallel cleaning of a network with brushes

Cites Work

• Unnamed Item
• Unnamed Item
• Cleaning random \(d\)-regular graphs with brooms
• Cleaning a network with brushes
• Parallel cleaning of a network with brushes
• Clean the graph before you draw it!
• Balanced vertex-orderings of graphs
• A note on bipartite subgraphs of triangle‐free graphs
• Cleaning Regular Graphs with Brushes
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

This page was built for publication: Cleaning with brooms