C. Lima

activity

20172022

most citedParameterized Complexity of Equitable Coloring

10 citations · 10 across the 3 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DM2018★ 10 cited

Parameterized Complexity of Equitable Coloring

Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius F. dos Santos

A graph on $n$ vertices is equitably $k$ -colorable if it is $k$ -colorable and every color is used either $⌊ n / k ⌋$ or $⌈ n / k ⌉$ times. S…

cs.DS2018

Dual parameterization of Weighted Coloring

Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima +3

Given a graph $G$ , a proper $k$ -coloring of $G$ is a partition $c = (S_{i})_{i \in [1, k]}$ of $V (G)$ into $k$ stable sets $S_{1}, \dots, S_{k}$ . Given a weight function $w: V(G) \to \ma…