27 citations · 28 across the 9 of their papers we have counts for
4 papers · 1 filter
Complexity of the (Connected) Cluster Vertex Deletion problem on -free graphs
Hoang-Oanh Le, Van Bang Le
The well-known Cluster Vertex Deletion problem (CVD) asks for a given graph and an integer whether it is possible to delete a set of at most vertices of such th…
On the -Claw Vertex Deletion Problem
Sun-Yuan Hsieh, Hoang-Oanh Le, Van Bang Le +1
Let -claw (or -star) stand for , the complete bipartite graph with 1 and vertices on each part. The -claw vertex deletion problem, -CLAW-VD, asks for…
Map graphs having witnesses of large girth
Hoang-Oanh Le, Van Bang Le
A half-square of a bipartite graph has one color class of as vertex set, say ; two vertices are adjacent whenever they have a common neighbor in . If $G=(V,…
Hardness and structural results for half-squares of restricted tree convex bipartite graphs
Hoang-Oanh Le, Van Bang Le
Let be a bipartite graph. A half-square of has one color class of as vertex set, say ; two vertices are adjacent whenever they have a common neighbor in .…