27 citations · 38 across the 13 of their papers we have counts for
16 papers
Hull Games of Induced Path Convexities in Graphs
Eurinardo Costa, Leon Almeida, Rudini Sampaio
In 1984, Frank Harary introduced the first convexity games in graphs, all of them based on the geodesic convexity, which is the graph convexity related to shortest paths. In 2024,…
The Normal Domination Partizan Game in Stars
João Marcos Brito, Edileudo M. Moreira Filho, Jefter G. M. Paz +1
The Domination game is an impartial game on graphs, introduced in 2010, and proved PSPACE-complete in the normal variant in 2026. In this game, Alice and Bob alternately select pla…
The iteration time and the general position number in graph convexities
Julio Araujo, Mitre C. Dourado, Fábio Protti +1
In this paper, we study two graph convexity parameters: iteration time and general position number. The iteration time was defined in 1981 in the geodesic convexity, but its comput…
The general position avoidance game and hardness of general position games
Ullas Chandran S. V., Sandi Klavzar, Neethu P. K. +1
Given a graph , a set of vertices in is a general position set if no triple of vertices from lie on a common shortest path in . The general position achievement/a…
Characterizations of graph classes via convex geometries: a survey
Mitre C. Dourado, Marisa Gutierrez, Fábio Protti +2
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexi…
Algorithms, hardness and graph products on a pursuit-evasion game
Eurinardo Costa, Nicolas Martins, Rudini Sampaio
In the -spy game over a graph, introduced by Cohen et al. in 2016, one spy and guards occupy vertices of a graph and, at each turn, each guard may move along one edge an…