27 citations · 68 across the 17 of their papers we have counts for
4 papers · 1 filter
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
Van Bang Le, Christian Rosenke
A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T with leaf set V(G) such that, for all vertices x, y in V(G), the edge xy exists in G if and only if the dis…
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…
Color-line and Proper Color-line Graphs
Van Bang Le, Florian Pfender
Motivated by investigations of rainbow matchings in edge colored graphs, we introduce the notion of color-line graphs that generalizes the classical concept of line graphs in a nat…
Forests and Trees among Gallai Graphs
Felix Joos, Van Bang Le, Dieter Rautenbach
The Gallai graph of a graph has the edges of as its vertices and two distinct vertices and of are adjacent in if the edges and of a…