2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/219937We present here some results on particular elimination schemes for chordal graphs, namely we show that for any chordal graph we can construct in linear time a simplicial elimination scheme starting with a pending maximal clique attached via a minimal separator maximal (resp. minimal) under inclusion among all minimal separators.Data Structures and Algorithmstext