A Decomposition Theorem for Chordal Graphs and its Applications

We introduce a special decomposition, the so-called split-minors, of the reduced clique graphs of chordal graphs. Using this notion, we characterize asteroidal sets in chordal graphs and clique trees with minimum number of leaves.

[1]  Michel Habib,et al.  Chordal Graphs and Their Clique Graphs , 1995, WG.

[2]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[3]  Terry A. McKee,et al.  The leafage of a chordal graph , 1998, Discuss. Math. Graph Theory.

[4]  Michel Habib,et al.  Polynomial-Time Algorithm for the Leafage of Chordal Graphs , 2009, ESA.

[5]  Dieter Kratsch,et al.  Asteroidal Sets in Graphs , 1997, WG.