Game brush number
From MaRDI portal
Publication:290091
DOI10.1016/j.dam.2016.02.011zbMath1337.05078arXiv1412.2034OpenAlexW1585664102MaRDI QIDQ290091
Paweł Prałat, William B. Kinnersley
Publication date: 1 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.2034
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two ⋮ Brushing number and zero-forcing number of graphs and their line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Brushing with additional cleaning restrictions
- Cleaning with brooms
- Cleaning random \(d\)-regular graphs with brooms
- Chip-firing games on graphs
- Cleaning a network with brushes
- Parallel cleaning of a network with brushes
- Clean the graph before you draw it!
- A bound for the game chromatic number of graphs
- \textsc{polish} -- Let us play the cleaning game
- Game matching number of graphs
- Brushing without capacity restrictions
- The chip-firing game
- Domination Game and an Imagination Strategy
- Imbalance Is Fixed Parameter Tractable
- Toppling numbers of complete and random graphs
- Cleaning Regular Graphs with Brushes
This page was built for publication: Game brush number