We give the first characterisation of graphs of linear cliquewidth at most 3, and we give a polynomial-time recognition algorithm for such graphs.
['Pinar Heggernes', 'D. Meister', 'C. Papadopoulos']
Graphs of linear clique-width at most 3