2 problems

Let $G$ be a regular tournament on $n$ vertices, and let $B(G)$ denote its brushing number. Regular-tournament brushing conjecture. If $G$ is regular, then … This extends the estab…

Let $G$ be a directed graph, and consider cleaning sequences in which multiple vertices that are ready to fire may fire simultaneously. Efficient-cleaning-sequence problem. Determi…