2 citations · 2 across the 3 of their papers we have counts for
3 papers
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 , the complete width of is the minimum such that there exist 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 is said to be an (unpartitioned) -probe block graph if there exist 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…