On Grundy indices for complete geometric graphs

Dolores Lara, Christian Rubio-Montiel, Francisco Zaragoza

The pseudo-Grundy index of a graph is the largest number of colors that can be assigned to its edges, such that for every pair of colors $i,j$, if $i<j$ then every edge colored w…