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

Showing math.COShow all

2 papers · 1 filter

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…

math.CO2012

On the threshold-width of graphs

M. Chang, L. Hung, T. Kloks +1

The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG…