Sheng-Lung Peng

most citedGood characterizations and linear time recognition for 2-probe block graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DM2022

On the $d$ -Claw Vertex Deletion Problem

Sun-Yuan Hsieh, Hoang-Oanh Le, Van Bang Le +1

Let $d$ -claw (or $d$ -star) stand for $K_{1, d}$ , the complete bipartite graph with 1 and $d \geq 1$ vertices on each part. The $d$ -claw vertex deletion problem, $d$ -CLAW-VD, asks for…

cs.DM2016

On the complete width and edge clique cover problems

Van Bang Le, Sheng-Lung Peng

A complete graph is the graph in which every two vertices are adjacent. For a graph $G = (V, E)$ , the complete width of $G$ is the minimum $k$ such that there exist $k$ independent se…

math.CO2016★ 2 cited

Good characterizations and linear time recognition for 2-probe block graphs

Van Bang Le, Sheng-Lung Peng

Block graphs are graphs in which every block (biconnected component) is a clique. A graph $G = (V, E)$ is said to be an (unpartitioned) $k$ -probe block graph if there exist $k$ indepe…

On the d-Claw Vertex Deletion Problem

On the complete width and edge clique cover problems

Good characterizations and linear time recognition for 2-probe block graphs

On the $d$ -Claw Vertex Deletion Problem