Follow
Ngoc Khang Le
Ngoc Khang Le
Verified email at ens-lyon.fr
Title
Cited by
Cited by
Year
List coloring digraphs
J Bensmail, A Harutyunyan, NK Le
Journal of Graph Theory 87 (4), 492-508, 2018
312018
Disjoint cycles of different lengths in graphs and digraphs
J Bensmail, A Harutyunyan, NK Le, B Li, N Lichiardopol
arXiv preprint arXiv:1510.06667, 2015
222015
On rank-width of even-hole-free graphs
I Adler, NK Le, H Müller, M Radovanović, N Trotignon, K Vušković
Discrete Mathematics & Theoretical Computer Science 19 (Graph Theory), 2017
122017
Chromatic number of ISK4-free graphs
NK Le
Graphs and Combinatorics 33 (6), 1635-1646, 2017
82017
Coloring even-hole-free graphs with no star cutset
NK Le
arXiv preprint arXiv:1805.01948, 2018
52018
Connected greedy colouring in claw-free graphs
NK Le, N Trotignon
arXiv preprint arXiv:1805.01953, 2018
52018
Efficient maximum matching algorithms for trapezoid graphs.
PT Do, NK Le, VT Vu
Electron. J. Graph Theory Appl. 5 (1), 7-20, 2017
52017
Detecting an induced subdivision of K4
NK Le
Journal of Graph Theory 90 (2), 160-171, 2019
42019
Detecting and coloring some graph classes
NK Le
Université de Lyon, 2018
32018
On rank-width of even-hole-free graphs
I Adler, NK Le, H Müller, M Radovanović, N Trotignon, K Vušković
arXiv preprint arXiv:1611.09907, 2016
2016
On rank-width of even-hole-free graphs
T Nicolas, I Adler, NK Le, H Müller, M Radovanović, K Vuskovic
Discrete Mathematics and Theoretical Computer Science DMTCS, 2016
2016
Cycle structure in directed graphs
NK LE
2015
An O(n(log n)3) algorithm for maximum matching in trapezoid graphs
NK Le, PT Do
The 2013 RIVF International Conference on Computing & Communication …, 2013
2013
The system can't perform the operation now. Try again later.
Articles 1–13