Van Bang Le
Van Bang Le
Verified email at uni-rostock.de - Homepage
Title
Cited by
Cited by
Year
Graph Classes: A Survey
A Brandstädt, VB Le, JP Spinrad
Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and …, 1999
22651999
The complexity of some problems related to graph 3-colorability
A Brandstädt, VB Le, T Szymczak
Discrete Applied Mathematics 89 (1), 59-73, 1998
721998
Tree spanners on chordal graphs: complexity and algorithms
A Brandstädt, FF Dragan, HO Le, VB Le
Theoretical Computer Science 310 (1), 329-354, 2004
59*2004
Structure and linear time recognition of 3-leaf powers
A Brandstädt, VB Le
Information Processing Letters 98 (4), 133-138, 2006
562006
Bisplit graphs
A Brandstädt, PL Hammer, VB Le, VV Lozin
Discrete Mathematics 299 (1), 11-32, 2005
512005
On stable cutsets in graphs
A Brandstädt, FF Dragan, VB Le, T Szymczak
Discrete Applied Mathematics 105 (1), 39-50, 2000
502000
Structure and linear-time recognition of 4-leaf powers
A Brandstädt, VB Le, R Sritharan
ACM Transactions on Algorithms (TALG) 5 (1), 11, 2008
422008
On the complexity of 4-coloring graphs without long induced paths
VB Le, B Randerath, I Schiermeyer
Theoretical Computer Science 389 (1), 330-335, 2007
41*2007
Gallai graphs and anti-Gallai graphs
VB Le
Discrete Mathematics 159 (1-3), 179-189, 1996
411996
Stability number of bull-and chair-free graphs revisited
A Brandstädt, CT Hoàng, VB Le
Discrete Applied Mathematics 131 (1), 39-50, 2003
332003
Graph subcolorings: complexity and algorithms
J Fiala, K Jansen, VB Le, E Seidel
SIAM Journal on Discrete Mathematics 16 (4), 635-650, 2003
322003
Tree spanners for bipartite graphs and probe interval graphs
A Brandstadt, FF Dragan, HO Le, VB Le, R Uehara
Algorithmica 47 (1), 27-51, 2007
30*2007
On stable cutsets in line graphs
VB Le, B Randerath
Theoretical computer science 301 (1), 463-475, 2003
30*2003
The square of a block graph
VB Le, NN Tuy
Discrete Mathematics 310 (4), 734-741, 2010
26*2010
Finding optimal rainbow connection is hard
VB Le, Z Tuza
preprint, 2009
262009
On stable cutsets in claw-free graphs and planar graphs
VB Le, R Mosca, H Müller
Journal of Discrete Algorithms 6 (2), 256-276, 2008
232008
Splitting a graph into disjoint induced paths or cycles
HO Le, VB Le, H Müller
Discrete applied mathematics 131 (1), 199-212, 2003
232003
Optimal tree 3‐spanners in directed path graphs
HO Le, VB Le
Networks: An International Journal 34 (2), 81-87, 1999
231999
Complexity of finding graph roots with girth conditions
B Farzad, LC Lau, VB Le, NN Tuy
Algorithmica 62 (1-2), 38-53, 2012
222012
Probe threshold and probe trivially perfect graphs
D Bayer, VB Le, HN de Ridder
Theoretical Computer Science 410 (47), 4812-4822, 2009
222009
The system can't perform the operation now. Try again later.
Articles 1–20