10 citations · 10 across the 6 of their papers we have counts for
4 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…
Disconnected Matchings
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2
In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgraph-restricted matchings in graphs, Discrete Mathematics, 293 (2005) 129 - 138] asked the computational comple…
On the proper interval completion problem within some chordal subclasses
François Dross, Claire Hilaire, Ivo Koch +4
Given a property (graph class) , a graph , and an integer , the \emph{-completion} problem consists in deciding whether we can turn into a graph with the property $…
Parameterized Complexity of Equitable Coloring
Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius F. dos Santos
A graph on vertices is equitably -colorable if it is -colorable and every color is used either or times. S…