Cleaning random \(d\)-regular graphs with brooms (Q659724): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:53, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cleaning random \(d\)-regular graphs with brooms |
scientific article |
Statements
Cleaning random \(d\)-regular graphs with brooms (English)
0 references
24 January 2012
0 references
cleaning with brushes
0 references
cleaning with Broom number
0 references
random \(d\)-regular graphs
0 references
differential equations method
0 references
graph searching
0 references
