24 citations · 37 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DM2019
An integer programming approach for solving a generalized version of the Grundy domination number
Manoel Campêlo, Daniel Severín
A sequence of vertices in a graph is called a legal dominating sequence if every vertex in the sequence dominates at least one vertex not dominated by those that precede it, and at…
cs.DM2019
Polyhedral study of the Convex Recoloring problem
Manoel Campêlo, Phablo F. S. Moura, Joel C. Soares
A coloring of the vertices of a connected graph is convex if each color class induces a connected subgraph. We address the convex recoloring (CR) problem defined as follows. Given…