Pages that link to "Item:Q5189512"
From MaRDI portal
The following pages link to Cleaning Regular Graphs with Brushes (Q5189512):
Displaying 20 items.
- Game brush number (Q290091) (← links)
- Brushing with additional cleaning restrictions (Q300254) (← links)
- Fast searching games on graphs (Q411259) (← links)
- Fast edge searching and fast searching on graphs (Q631784) (← links)
- Cleaning with brooms (Q659685) (← links)
- Cleaning random \(d\)-regular graphs with brooms (Q659724) (← links)
- Burning grids and intervals (Q831694) (← links)
- Parallel cleaning of a network with brushes (Q968165) (← links)
- Clean the graph before you draw it! (Q987793) (← links)
- The robot crawler graph process (Q1671307) (← links)
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- \textsc{polish} -- Let us play the cleaning game (Q1929225) (← links)
- Burning graphs: a probabilistic perspective (Q2014226) (← links)
- Burning number of theta graphs (Q2279597) (← links)
- Three-fast-searchable graphs (Q2446838) (← links)
- Brushing without capacity restrictions (Q2449081) (← links)
- Elimination schemes and lattices (Q2449178) (← links)
- How to Burn a Graph (Q5856432) (← links)
- Burning and \(w\)-burning of geometric graphs (Q6103478) (← links)
- Burning Numbers of Barbells (Q6489821) (← links)