1. Berry, A.: A wide-range efficient algorithm for minimal triangulation. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, USA, 17–19 January 1999, pp. 860–861 (1999)
2. Berry, A., Bordat, J.P., Heggernes, P.: Recognizing weakly triangulated graphs by edge separability. Nord. J. Comput. 7(3), 164–177 (2000)
3. Bouchitté, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212–232 (2001)
4. Cameron, R.D., Colbourn, C.J., Read, R.C., Wormald, N.C.: Cataloguing the graphs on 10 vertices. J. Graph Theory 9(4), 551–562 (1985)
5. Feghali, C., Fiala, J.: Reconfiguration graph for vertex colourings of weakly chordal graphs. CoRR, abs/1902.08071 (2019)