Cleaning random graphs with brushes
From MaRDI portal
Recommendations
Cited in
(15)- Brushing number and zero-forcing number of graphs and their line graphs
- Game brush number
- Brushing with additional cleaning restrictions
- Cleaning with brooms
- 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!
- Burning graphs: a probabilistic perspective
- Cleaning regular graphs with brushes
- \textsc{polish} -- Let us play the cleaning game
- A note on the parallel cleaning of cliques
- Brushing without capacity restrictions
- Elimination schemes and lattices
- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
This page was built for publication: Cleaning random graphs with brushes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614030)
