Title of article
On some simplicial elimination schemes for chordal graphs
Author/Authors
Habib، نويسنده , , Michel and Limouzy، نويسنده , , Vincent، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
8
From page
125
To page
132
Abstract
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.
Keywords
minimal separators , simplicial elimination scheme , reduced clique graph , chordal graphs
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2009
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455010
Link To Document