This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2024-193778
If you've NEVER registered a DOI in your Lattes, check our tutorial!In 1981, the first paper in English on graph convexity was published. Three years later, in 1984, one of its authors, Frank Harary, introduced the first convexity games. Although defined a long time ago, the last research on convexity games dated back to 2003, with few significant results due to their difficulty. In this work, we were able to use the Sprague-Grundy theory to solve convexity games in special graphs, such as trees. In addition, we have proven that one of these games is PSPACE-hard, which puts it a level of complexity above NP-hard problems.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper