2 citations · 3 across the 3 of their papers we have counts for
3 papers · 1 filter
FPT and kernelization algorithms for the k-in-a-tree problem
Guilherme C. M. Gomes, Vinicius F. dos Santos, Murilo V. G. da Silva +1
The three-in-a-tree problem asks for an induced tree of the input graph containing three mandatory vertices. In 2006, Chudnovsky and Seymour [Combinatorica, 2010] presented the fir…
Reducing graph transversals via edge contractions
Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau +1
For a graph invariant , the Contraction() problem consists in, given a graph and two positive integers , deciding whether one can contract at most edges of t…
Structural Parameterizations for Equitable Coloring
Guilherme C. M. Gomes, Matheus R. Guedes, Vinicius F. dos Santos
An -vertex graph is equitably -colorable if there is a proper coloring of its vertices such that each color is used either or $\left\lceil n/…