Impartial geodetic building games on graphs

A subset of the vertex set of a graph is geodetically convex if it contains every vertex on any shortest path between two elements of the set. The convex hull of a set of vertices is the smallest convex set containing the set. We study two games where two players take turns selecting previously-unse...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-07
Hauptverfasser:	Benesh, Bret J, Ernst, Dana C, Meyer, Marie, Salmon, Sarah, Sieben, Nandor
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Convexity Games Graph theory Shortest-path problems Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!