3 citations · 9 across the 5 of their papers we have counts for
7 papers
Connected greedy colouring in claw-free graphs
Ngoc Khang Le, Nicolas Trotignon
An ordering of the vertices of a graph is \emph{connected} if every vertex (but the first) has a neighbor among its predecessors. The greedy colouring algorithm of a graph with a c…
Coloring even-hole-free graphs with no star cutset
Ngoc Khang Le
A \emph{hole} is a chordless cycle of length at least . A graph is \emph{even-hole-free} if it does not contain any hole of even length as an induced subgraph. In this paper, we…
Detecting induced subdivision of
Ngoc Khang Le
In this paper, we propose a polynomial-time algorithm to test whether a given graph contains a subdivision of as an induced subgraph.
Chromatic number of ISK4-free graphs
Ngoc Khang Le
A graph is said to be ISK4-free if it does not contain any subdivision of as an induced subgraph. In this paper, we propose new upper bounds for chromatic number of ISK4-…
On rank-width of even-hole-free graphs
Isolde Adler, Ngoc Khang Le, Haiko Müller +3
We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width. In general, even-hole-free graphs have unbounded rank-width, because cho…
List coloring digraphs
Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le
The dichromatic number of a digraph is the least number such that the vertex set of can be partitioned into parts each of which induces an acyclic subdig…