The following pages link to Clean the graph before you draw it! (Q987793):
Displaying 13 items.
- Game brush number (Q290091) (← links)
- Brushing with additional cleaning restrictions (Q300254) (← links)
- Cleaning with brooms (Q659685) (← links)
- Cleaning random \(d\)-regular graphs with brooms (Q659724) (← links)
- Parallel cleaning of a network with brushes (Q968165) (← 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)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Imbalance is fixed parameter tractable (Q2445234) (← links)
- Brushing without capacity restrictions (Q2449081) (← links)
- Elimination schemes and lattices (Q2449178) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
