Hans-Jürgen Bandelt and Henry Martyn Mulder. “Distance-hereditary graphs”. In: J. Comb. Theory, Ser. B 41.2 (1986), pp. 182-208. DOI:10.1016/0095-8956(86)90043-2.
Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, and Lucas Pastor. “Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes”. In: CoRR abs/2007.01031 (2020). arXiv: 2007.01031.
Yixin Cao. “Enumerating Maximal Induced Subgraphs”. In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands. Ed. by Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman. Vol. 274. LIPIcs. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023, 31:1-31:13. DOI:10.4230/LIPIcs.ESA.2023.31.
Frank Pok Man Chu. “A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements”. In:Inf. Process. Lett. 107.1 (2008), pp. 7-12. DOI:10.1016/J.IPL.2007.12.009.
Sara Cohen, Benny Kimelfeld, and Yehoshua Sagiv. “Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties”. In:J. Comput. Syst. Sci. 74.7 (2008), pp. 1147-1159. DOI:10.1016/j.jcss.2008.04.003.