27 citations · 68 across the 17 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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…