P. Aboulker, P. Charbit, N. Trotignon, and K. Vu?kovi?, Vertex elimination orderings for hereditary graph classes, Discrete Mathematics, vol.338, issue.5, pp.825-834, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01230783

A. Berry and J. Bordat, Separability generalizes Dirac's theorem, Discrete Applied Mathematics, vol.84, issue.1-3, pp.43-53, 1998.

. Bcg-+-19]-jesse, M. Beisegel, V. Chudnovsky, M. Gurvich, M. Milani? et al., Avoidable vertices and edges in graphs, Algorithms and Data Structures, pp.126-139, 2019.

M. Cygan, ?. Fedor-v-fomin, D. Kowalik, D. Lokshtanov, and . Marx, Marcin Pilipczuk, Micha? Pilipczuk, and Saket Saurabh. Parameterized algorithms, 2015.

V. Chvátal, I. Rusu, and R. Sritharan, Dirac-type characterizations of graphs without long chordless cycles, Discrete Mathematics, vol.256, issue.1-2, pp.445-448, 2002.

G. Andrew and D. , On rigid circuit graphs, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol.25, issue.1, pp.71-76, 1961.

T. Ohtsuki, K. Lap, T. Cheung, and . Fujisawa, Minimal triangulation of a graph and optimal pivoting order in a sparse matrix, Journal of Mathematical Analysis and Applications, vol.54, issue.3, pp.622-633, 1976.