On some simplicial elimination schemes for chordal graphs

We introduced here an interesting tool for the structural study of chordal graphs, namely the Reduced Clique Graph. Using some of its combinatorial properties 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 under inclusion among all minimal separators.