Danilo Artigas
YOU?
Author Swipe
Graceful game on some graph classes Open
A graceful labeling of a graph G with m edges consists in labeling the vertices of G with distinct integers from 0 to m such that each edge is uniquely identified by the absolute difference of the labels of its endpoints. In this work, we …
On the edge-sum distinguishing game Open
The Edge-Sum Distinguishing game (ESD game) is a graph labeling game proposed by Tuza in 2017.In such a game, the players, traditionally called Alice and Bob, alternately assign an unused label f (v) ∈ {1, . . ., s} to an unlabeled vertex …
Geodesic Convexity of graphs: partition and geodetic sets Open
This work describes the contribution of Artigas, Dantas, Dourado, and Szwarcfiter on the topic of convexity in the context of geodesic convex partitions, covers and geodetic sets from 2008 to 2013.