1. Berry, A., Bordat, J.-P., Heggernes, P., Simonet, G., Villanger, Y.: A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms (to appear)
2. Blair, J.R.S., Heggernes, P., Telle, J.A.: A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250, 125–141 (2001)
3. Földes, S., Hammer, P.L.: Split graphs. Congressus Numerantium 19, 311–315 (1977)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1978)
5. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)