3 papers
math.CO2026
Impartial geodetic removing games on graphs
Bret J. Benesh, Dana C. Ernst, Marie Meyer +2
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 subset. The convex hull of a set of vertic…
math.CO2025
Impartial removing games on grid graphs
Bret J. Benesh, Dana C. Ernst, Marie Meyer +2
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 subset. The convex hull of a set of vertic…
math.CO2024
Impartial geodetic building games on graphs
Bret J. Benesh, Dana C. Ernst, Marie Meyer +2
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…