10 citations · 10 across the 6 of their papers we have counts for
3 papers · 1 filter
Edge deletion to tree-like graph classes
Ivo Koch, Nina Pardal, Vinicius Fernandes dos Santos
For a fixed property (graph class) , given a graph G and an integer k, the -deletion problem consists in deciding if we can turn into a graph with the property by del…
On the arboreal jump number of a poset
Evellyn S. Cavalcante, Sebastián Urrutia, Vinicius F. dos Santos
A jump is a pair of consecutive elements in an extension of a poset which are incomparable in the original poset. The arboreal jump number is an NP-hard problem that aims to find a…
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…