Cleaning random d-regular graphs with brooms
From MaRDI portal
Publication:659724
DOI10.1007/S00373-010-0986-XzbMATH Open1235.05126OpenAlexW2043886025MaRDI QIDQ659724FDOQ659724
Authors: 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-0986-x
Recommendations
graph searchingcleaning with Broom numbercleaning with brushesdifferential equations methodrandom \(d\)-regular graphs
Cites Work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Expander graphs and their applications
- Explicit construction of linear sized tolerant networks
- Title not available (Why is that?)
- Cleaning random graphs with brushes
- Cleaning regular graphs with brushes
- Cleaning 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
- Title not available (Why is that?)
- Differential equations for random processes and random graphs
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- A proof of alon's second eigenvalue conjecture
- Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
- A note on bipartite subgraphs of triangle‐free graphs
- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
Cited In (10)
- Game brush number
- Brushing with additional cleaning restrictions
- Cleaning with brooms
- Parallel cleaning of a network with brushes
- Cleaning random graphs with brushes
- Burning graphs: a probabilistic perspective
- Cleaning regular graphs with brushes
- \textsc{polish} -- Let us play the cleaning game
- Brushing without capacity restrictions
- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
Uses Software
This page was built for publication: Cleaning random \(d\)-regular graphs with brooms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659724)
