H. Bandelt and H. Mulder, Distance-hereditary graphs, Journal of Combinatorial Theory, Series B, vol.41, pp.182-208, 1986.

A. Brandstädt and V. B. Le, Structure and linear-time recognition of 3-leaf powers, Inf. Process. Lett, vol.98, pp.133-138, 2006.

M. S. Chang, S. Y. Hsieh, and G. H. Chen, Dynamic programming on distance-hereditary graphs, Proceedings of ISAAC 1997, vol.1350, pp.344-353, 1997.

C. Chauve, É. Fusy, and J. Lumbroso, An exact enumeration of distancehereditary graphs, Proceedings of ANALCO (14th Workshop on Analytic Algorithmics and Combinatorics), pp.31-45, 2017.

S. Cicerone and G. D. Stefano, On the extension of bipartite to parity graphs, Discrete Applied Mathematics, vol.95, pp.181-195, 1999.

B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theor. Comput. Sci, vol.55, pp.141-181, 1987.

B. Courcelle, The monadic second-order logic of graphs XVI : Canonical graph decompositions, Logical Methods in Computer Science, vol.2, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00334069

B. Courcelle, On the model-checking of monadic second-order formulas with edge set quantifications, Discrete Applied Mathematics, vol.160, pp.866-887, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00481735

B. Courcelle, Clique-width and edge contraction, Inf. Process. Lett, vol.114, pp.42-44, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00838630

B. Courcelle, From tree decompositions to clique-width terms, Discrete Applied Mathematics, vol.248, pp.125-144, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01398972

B. Courcelle, On quasi-planar graphs : clique-width and logical description, Discrete Applied Mathematics, this issue, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01735820

B. Courcelle and I. Durand, Automata for the verification of monadic second-order graph properties, J. Applied Logic, vol.10, pp.368-409, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00611853

B. Courcelle and I. Durand, Computations by fly-automata beyond monadic second-order logic, Theor. Comput. Sci, vol.619, pp.32-67, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01757762

B. Courcelle and J. Engelfriet, Graph structure and monadic second-order logic, a language theoretic approach, of Encyclopedia of mathematics and its application, vol.138, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00646514

B. Courcelle, P. Heggernes, D. Meister, C. Papadopoulos, and U. Rotics, A characterisation of clique-width through nested partitions, Discrete Applied Maths, vol.187, pp.70-81, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01022109

B. Courcelle and M. Kanté, Graph operations characterizing rank-width, vol.157, pp.627-640, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00334159

B. Courcelle, J. Makowsky, and U. Rotics, Linear-time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst, vol.33, pp.125-150, 2000.

W. Cunningham, Decomposition of directed graphs, SIAM. J. on Algebraic and Discrete Methods, vol.3, pp.214-228, 1981.

R. Diestel, Graph theory, 2006.

R. Downey and M. Fellows, Fundamentals of parameterized complexity, 2013.

I. Durand, TRAG: Term Rewriting Automata and Graphs, a software developped since 2015

I. Durand and M. Raskin, TRAG-WEB: Term Rewriting Automata and Graphs (online), Web interface under development, 2018.

M. Fellows, F. Rosamond, U. Rotics, and S. Szeider, Clique-width is NPcomplete, SIAM J. Discrete Math, vol.23, pp.909-939, 2009.

E. Fischer, J. Makowsky, and E. Ravve, Counting truth assignments of formulas of bounded tree-width or clique-width, Discrete Applied Mathematics, vol.156, pp.511-529, 2008.

P. Flajolet, P. Zimmermann, and B. Van-cutsem, A calculus for the random generation of labelled combinatorial structures, Theor. Comput. Sci, vol.132, pp.1-35, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00917729

F. Fomin, S. Oum, and D. Thilikos, Rank-width and tree-width of H-minor-free graphs, Eur. J. Comb, vol.31, pp.1617-1628, 2010.

E. Gioan and C. Paul, Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs, Discrete Applied Mathematics, vol.160, pp.708-733, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00783420

E. Gioan, C. Paul, M. Tedder, and D. Corneil, Practical and efficient split decomposition via graph-labelled trees, Algorithmica, vol.69, pp.789-843, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-00805193

M. Golumbic and U. Rotics, On the clique-width of some perfect graph classes, Int. J. Found. Comput. Sci, vol.11, pp.423-443, 2000.

F. Gurski, The behavior of clique-width under graph operations and graph transformations, Theory Comput. Syst, vol.60, pp.346-376, 2017.

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, pp.41-59, 2010.

P. Heggernes, D. Meister, and C. Papadopoulos, Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs, Discrete Applied Mathematics, vol.160, pp.888-90, 2012.

P. Hlinený, S. Oum, D. Seese, and G. Gottlob, Width parameters beyond tree-width and their applications, Comput. J, vol.51, pp.326-362, 2008.

M. Kanté and M. Rao, The rank-width of edge-coloured graphs, Theory Comput. Syst, vol.52, pp.599-644, 2013.

M. Kanté and M. Rao, Directed rank-width and displit decomposition, Proceedings of WG 2009, vol.5911, pp.214-225, 2010.

D. Meister, Clique-width with an inactive label, Discrete Mathematics, vol.337, pp.34-64, 2014.

S. Oum, Rank-width and vertex-minors, Journal of Combinatorial Theory, Series B, vol.95, pp.79-100, 2005.

V. Ravelomanana and L. Thimonier, Asymptotic enumeration of cographs. Electronic Notes in Discrete Mathematics, pp.58-61, 2001.