Most of modern applications of graphical models are based on directed acyclic graphs (DAGs). This lecture is concerned with Markov properties for such graphs and the relations between them.
The closest text can be found in section 3.2.2 of [GM], pp. 46-53.
Overheads for screen-viewing and printing.