3 citations · 9 across the 5 of their papers we have counts for
Showing 2018 · cs.DMShow all
2 papers · 2 filters
cs.DM2018★ 3 cited
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…
cs.DM2018★ 2 cited
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…