research
∙
10/13/2022
Perfect matching cuts partitioning a graph into complementary subgraphs
In Partition Into Complementary Subgraphs (Comp-Sub) we are given a grap...
share
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
∙
09/21/2018
On the convexity number for complementary prisms
In the geodetic convexity, a set of vertices S of a graph G is convex if...
research
∙
07/22/2018