56 citations · 715 across the 68 of their papers we have counts for
1 paper · 1 filter
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…