2 citations · 3 across the 3 of their papers we have counts for
8 papers
Weighted Connected Matchings
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2
A matching is a -matching if the subgraph induced by the endpoints of the edges of satisfies property . As examples, for appropriate choices of $\…
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(…
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…
Some results on Vertex Separator Reconfiguration
Guilherme C. M. Gomes, Sérgio H. Nogueira, Vinicius F. dos Santos
We present the first results on the complexity of the reconfiguration of vertex separators under the three most popular rules: token addition/removal, token jumping, and token slid…
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…