On Grundy indices for complete geometric graphs
Combinatorics
2025-10-20 v1 Computational Geometry
Abstract
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 , if then every edge colored with color is adjacent to at least one edge colored with color . This index has been widely studied. A geometric graph is a graph drawn in the plane such that its vertices are points in general position, and its edges are straight-line segments. In this paper, we extend the notion of pseudo-Grundy index for geometric graphs, and present results for complete geometric graphs.
Keywords
Cite
@article{arxiv.2510.15155,
title = {On Grundy indices for complete geometric graphs},
author = {Dolores Lara and Christian Rubio-Montiel and Francisco Zaragoza},
journal= {arXiv preprint arXiv:2510.15155},
year = {2025}
}