Undirected clique-with was introduced by [1]} and is defined correspondingly. In the undirected case, co-graphs are exactly the graphs of clique-width at most 2 and distance-hereditary graphs have clique-width at most 3. This leads to the idea of regarding directed clique-width on twin-dh digraphs.
