Cleaning Regular Graphs with Brushes

DOI10.1137/070703053zbMath1187.05066OpenAlexW2009637942MaRDI QIDQ5189512

Paweł Prałat, Noga Alon, Nicholas C. Wormald

Publication date: 17 March 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070703053

zbMATH Keywords

cleaning process: random d-regular graph: differential equations method: degree-greedy algorithm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (19)

Burning grids and intervals ⋮ Game brush number ⋮ Brushing with additional cleaning restrictions ⋮ The robot crawler graph process ⋮ \textsc{polish} -- Let us play the cleaning game ⋮ Burning and \(w\)-burning of geometric graphs ⋮ Fast searching games on graphs ⋮ Fast edge searching and fast searching on graphs ⋮ Three-fast-searchable graphs ⋮ Brushing without capacity restrictions ⋮ Elimination schemes and lattices ⋮ Cleaning with brooms ⋮ Cleaning random \(d\)-regular graphs with brooms ⋮ Brushing number and zero-forcing number of graphs and their line graphs ⋮ Parallel cleaning of a network with brushes ⋮ Burning graphs: a probabilistic perspective ⋮ Clean the graph before you draw it! ⋮ Burning number of theta graphs ⋮ How to Burn a Graph

This page was built for publication: Cleaning Regular Graphs with Brushes