Hoàng-Oanh Le

activity

20162025

most citedA complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter

27 citations · 28 across the 9 of their papers we have counts for

collaborators

Showing 2018 · cs.DMShow all

2 papers · 2 filters

cs.DM2018★ 1 cited

Map graphs having witnesses of large girth

Hoang-Oanh Le, Van Bang Le

A half-square of a bipartite graph $B = (X, Y, E_{B})$ has one color class of $B$ as vertex set, say $X$ ; two vertices are adjacent whenever they have a common neighbor in $Y$ . 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 $B = (X, Y, E)$ be a bipartite graph. A half-square of $B$ has one color class of $B$ as vertex set, say $X$ ; two vertices are adjacent whenever they have a common neighbor in $Y$ .…