We prove that every connected P_5-free graph has cop number at most two,...
The burning number b(G) of a graph G is the smallest number of turns
req...
We prove that the stack-number of the strong product of three n-vertex
p...
The main problem in the area of property testing is to understand which ...
share