1 problem

The three-sevenths upper-bound conjecture for the game isolation number
Three-sevenths upper-bound conjecture. For any graph $G$ with no $K_2$ -components,
opendomination-games graph-theory isolation-games
0 responses
05