Cleaning with brooms

DOI10.1007/S00373-010-0965-2zbMATH Open1235.05094OpenAlexW2091551894MaRDI QIDQ659685FDOQ659685

Authors: Margaret-Ellen Messinger, R. J. Nowakowski, 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

Recommendations

• scientific article
• Cleaning regular graphs with brushes
• The brush number of the two-dimensional torus
• Brushing without capacity restrictions
• Brushing with additional cleaning restrictions

zbMATH Keywords

chip-firing gamebrush numbergraph searchingbroom numbergraph cleaning

Mathematics Subject Classification ID

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

Cites Work

• Cleaning random graphs with brushes
• Cleaning regular graphs with brushes
• 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
• On the complexity of the balanced vertex ordering problem
• A note on bipartite subgraphs of triangle‐free graphs
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

Cited In (8)

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

This page was built for publication: Cleaning with brooms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659685)