13 citations · 21 across the 7 of their papers we have counts for
8 papers
New Results on Edge-coloring and Total-coloring of Split Graphs
Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein
A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A connected graph is said to be -admissible if admits a special spanning t…
FPT algorithms to recognize well covered graphs
Rafael Araujo, Eurinardo Costa, Sulamita Klein +2
Given a graph , let and be the sizes of a minimum and a maximum minimal vertex covers of , respectively. We say that is well covered if …
Maximum cuts in edge-colored graphs
Luerbio Faria, Sulamita Klein, Ignasi Sau +2
The input of the Maximum Colored Cut problem consists of a graph with an edge-coloring and a positive integer , and the question is wheth…
On the (parameterized) complexity of recognizing well-covered (r,l)-graphs
Sancrey R. Alves, Konrad K. Dabrowski, Luerbio Faria +3
An -partition of a graph is a partition of its vertex set into independent sets and cliques. A graph is if it admits an -partition.…
Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs
Luerbio Faria, Sulamita Klein, Ignasi Sau +1
A graph is signed if each edge is assigned or . A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign if and only if its…
Parameterized complexity dichotomy for -Vertex Deletion
Julien Baste, Luerbio Faria, Sulamita Klein +1
For two integers , a graph is an -graph if can be partitioned into independent sets and cliques. In the parameterized $(r,\ell…