10 citations · 10 across the 3 of their papers we have counts for
7 papers
On the Computational Complexity of the Strong Geodetic Recognition Problem
Carlos V. G. C. Lima, Vinicius F. dos Santos, João H. G. Sousa +1
A strong geodetic set of a graph~ is a vertex set~ in which it is possible to cover all the remaining vertices of~ by assigning a uniqu…
On the proper orientation number of chordal graphs
Julio Araujo, Alexandre Cezar, Carlos V. G. C. Lima +2
An orientation of a graph is a digraph obtained from by replacing each edge by exactly one of the two possible arcs with the same end vertices. For each $v \in V(…
Target set selection with maximum activation time
Lucas Keiler, Carlos Vinicius G. C. Lima, Ana Karolinna Maia +2
A target set selection model is a graph with a threshold function upper-bounded by the vertex degree. For a given model, a set is a targ…
Intersection graph of maximal stars
Guilherme C. M. Gomes, Marina Groshaus, Carlos V. G. C. Lima +1
A biclique of a graph is an induced complete bipartite subgraph of such that neither part is empty. A star is a biclique of such that one part has exactly one vertex. T…
Parameterized Complexity of Equitable Coloring
Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius F. dos Santos
A graph on vertices is equitably -colorable if it is -colorable and every color is used either or times. S…
Dual parameterization of Weighted Coloring
Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima +3
Given a graph , a proper -coloring of is a partition of into stable sets . Given a weight function $w: V(G) \to \ma…