research
∙
03/10/2023
Thinness and its variations on some graph families and coloring graphs of bounded thinness
Interval graphs and proper interval graphs are well known graph classes,...
share
research
∙
07/05/2022
Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value
This paper presents an empirical performance analysis of three project s...
research
∙
04/25/2022
Some New Results on Efficient and Perfect Edge Domination of Graphs
A neighborhood star-free graph is one in which every vertex of degree at...
research
∙
03/08/2022
Edge Intersection Graphs of Paths on a Triangular Grid
We introduce a new class of intersection graphs, the edge intersection g...
research
∙
02/09/2022
Weighted Connected Matchings
A matching M is a 𝒫-matching if the subgraph induced by the endpoints of...
research
∙
12/16/2021
Disconnected Matchings
In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgrap...
research
∙
07/08/2020
FPT and kernelization algorithms for the k-in-a-tree problem
The three-in-a-tree problem asks for an induced tree of the input graph ...
research
∙
06/30/2020
Precedence thinness in graphs
Interval and proper interval graphs are very well-known graph classes, f...
research
∙
06/30/2020
Thinness of product graphs
The thinness of a graph is a width parameter that generalizes some prope...
research
∙
04/12/2020
Linear-time Algorithms for Eliminating Claws in Graphs
Since many NP-complete graph problems have been shown polynomial-time so...
research
∙
06/26/2019
The Complexity of Helly-B_1 EPG Graph Recognition
Golumbic, Lipshteyn and Stern defined in 2009 the class of EPG graphs, a...
research
∙
07/22/2018
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...
research
∙
10/21/2017
