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 cs.DMShow 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.DM2017

On the Computational Complexity of the Bipartizing Matching Problem

Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza +1

We study the problem of determining whether a given graph~ $G = (V, E)$ admits a matching~ $M$ whose removal destroys all odd cycles of~ $G$ (or equivalently whether~ $G - M$ is bipartite).…