Interval graphs and proper interval graphs are well known graph classes,...
This paper presents an empirical performance analysis of three project
s...
A neighborhood star-free graph is one in which every vertex of degree at...
We introduce a new class of intersection graphs, the edge intersection g...
A matching M is a 𝒫-matching if the subgraph induced by the
endpoints of...
In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized
subgrap...
The three-in-a-tree problem asks for an induced tree of the input graph
...
Interval and proper interval graphs are very well-known graph classes, f...
The thinness of a graph is a width parameter that generalizes some prope...
Since many NP-complete graph problems have been shown polynomial-time
so...
Golumbic, Lipshteyn and Stern defined in 2009 the class of EPG graphs, a...
Let G be a finite, simple, and undirected graph and let S be a set of
ve...
We study the problem of determining whether a given graph G=(V, E) admit...