A directed acyclic graph which underlies a directed Markov field may a
llow reversals and omissions of arcs without affecting the Markov fiel
d. Feasible manipulations of the graph are shown to be related. A cons
truction of the graph starting from scratch is discussed. Also, notion
s of simplicity are given for approximations of Markov fields.