1. Alon, N., Kahn, J., Seymour, P.D.: Large induced degenerate subgraphs. Graph. Combin. 3(1), 203–211 (1987)
2. Bauer, R., Krug, M., Wagner, D.: Enumerating and generating labeled $$k$$ -degenerate graphs. In: 2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, pp. 90–98. SIAM, Philadelphia (2010)
3. Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1–29. Springer, New York (1993)
4. Lecture Notes in Computer Science;LS Chandran,2001
5. Conte, A., Grossi, R., Marino, A., Versari, L.: Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques. In: ICALP (2016)