Undirected Chordal Graphs
Undirected Chordal Graphs
- Lemma: It is possible to direct the edges in a triangulated undirected graph so that there are no directed cycles and no ‘unshielded colliders’ :
- an ‘unshielded collider’ is an induced subgraph:
X
Y
Z
(with no edge X—Z)
It follows that there is a directed graph which is a perfect
map for the dependencies and independencies
represented by a triangulated undirected graph.