Polynomial Time Recognition of Clique-Width le leq 3 Graphs (Extended Abstract). - Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce A. Reed; Udi Rotics (LATIN, 2000)

Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs. - Jean-Marc Lanlignel; Olivier Raynaud; Eric Thierry (STACS, 2000)

On end-vertices of Lexicographic Breadth First Searches. - Derek G. Corneil; Ekkehard Köhler; Jean-Marc Lanlignel (Discret. Appl. Math., 2010)

Polynomial-time recognition of clique-width ≤3 graphs. - Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce A. Reed; Udi Rotics (Discret. Appl. Math., 2012)