V. B. Le

activity

20092026

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

27 citations · 75 across the 18 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.CC2014

Squares of $3$ -sun-free split graphs

Van Bang Le, Andrea Oversberg, Oliver Schaudt

The square of a graph $G$ , denoted by $G^{2}$ , is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root…

cs.DM2014★ 2 cited

Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs

Van Bang Le, Andrea Oversberg, Oliver Schaudt

The square of a graph $G$ , denoted $G^{2}$ , is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of…

Squares of 3-sun-free split graphs

Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs

Squares of $3$ -sun-free split graphs