27 citations · 28 across the 9 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DM2018★ 1 cited
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,…
cs.DM2018
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 .…
cs.CC2018★ 27 cited
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter
Hoang-Oanh Le, Van Bang Le
In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-compl…