Cleaning with brooms

DOI10.1007/S00373-010-0965-2MaRDI QIDQ659685zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

chip-firing gamebrush numbergraph searchingbroom numbergraph cleaning

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

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

Cited in

(8)

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