![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Ngoc-Khang Le
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j7]Ngoc-Khang Le
:
Detecting an induced subdivision of K4. J. Graph Theory 90(2): 160-171 (2019) - 2018
- [j6]Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le:
List coloring digraphs. J. Graph Theory 87(4): 492-508 (2018) - [i5]Ngoc-Khang Le:
Coloring even-hole-free graphs with no star cutset. CoRR abs/1805.01948 (2018) - [i4]Ngoc-Khang Le, Nicolas Trotignon:
Connected greedy colouring in claw-free graphs. CoRR abs/1805.01953 (2018) - 2017
- [j5]Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le, Binlong Li, Nicolas Lichiardopol:
Disjoint Cycles of Different Lengths in Graphs and Digraphs. Electron. J. Comb. 24(4): 4 (2017) - [j4]Isolde Adler, Ngoc-Khang Le, Haiko Müller
, Marko Radovanovic
, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j3]Phan-Thuan Do, Ngoc-Khang Le, Van-Thieu Vu:
Efficient maximum matching algorithms for trapezoid graphs. Electron. J. Graph Theory Appl. 5(1): 7-20 (2017) - [j2]Ngoc-Khang Le:
Detecting an induced subdivision of K4. Electron. Notes Discret. Math. 62: 315-320 (2017) - [j1]Ngoc-Khang Le
:
Chromatic Number of ISK4-Free Graphs. Graphs Comb. 33(6): 1635-1646 (2017) - [i3]Ngoc-Khang Le:
Detecting induced subdivision of K4. CoRR abs/1703.04637 (2017) - 2016
- [i2]Ngoc-Khang Le:
Chromatic number of ISK4-free graphs. CoRR abs/1611.04279 (2016) - [i1]Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. CoRR abs/1611.09907 (2016) - 2013
- [c1]Ngoc-Khang Le, Phan-Thuan Do:
An O(n(log n)3) algorithm for maximum matching in trapezoid graphs. RIVF 2013: 157-162
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint