2 citations · 2 across the 5 of their papers we have counts for
6 papers · 1 filter
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…
The Perfect Matching Cut Problem Revisited
Van Bang Le, Jan Arne Telle
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut…
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 .…
Characterization and recognition of some opposition and coalition graph classes
Van Bang Le, Thomas Podelleck
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, re…
Computing Graph Roots Without Short Cycles
Babak Farzad, Lap Chi Lau, Van Bang Le +1
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however M…