The Intersection Graphs of Subtrees in Trees Are Exactly the Chordal Graphs: A Finite Graph Is a Subtree Graph If and Only If It Is ChordalResearch Paper
Chordal graphs (graphs in which every long cycle has a shortcut edge) appear wherever a sparse symmetric structure has to be eliminated without creating new interactions: Gaussian elimination on sparse symmetric matrices (Rose 1970), acyclic database schemes, junction trees for probabilistic graphical models, and phylogenetic and scheduling problems. In all…