
FPT and kernelization algorithms for the kinatree problem
The threeinatree problem asks for an induced tree of the input graph ...
read it

Precedence thinness in graphs
Interval and proper interval graphs are very wellknown graph classes, f...
read it

Thinness of product graphs
The thinness of a graph is a width parameter that generalizes some prope...
read it

Lineartime Algorithms for Eliminating Claws in Graphs
Since many NPcomplete graph problems have been shown polynomialtime so...
read it

The Complexity of HellyB_1 EPG Graph Recognition
Golumbic, Lipshteyn and Stern defined in 2009 the class of EPG graphs, a...
read it

On the Geodetic Hull Number of Complementary Prisms
Let G be a finite, simple, and undirected graph and let S be a set of ve...
read it

Eliminating Odd Cycles by Removing a Matching
We study the problem of determining whether a given graph G=(V, E) admit...
read it
Jayme L. Szwarcfiter
is this you? claim profile