J. Nascimento

Greedy approaches for Gold Grabbing on subclasses of split graphs

It is proved that for complete split graphs $CS_{(2,n)}$, the greedy strategy yields a sequence of moves that maximizes the game value, contributing to a better understanding of the structural conditions that ensure the optimality of simple strategies in graph-based combinatorial games.