  We introduce a graph theoretic property called Condition (N) for finitely
separated graphs and prove that it is equivalent to both nuclearity and
exactness of the associated universal tame graph C*-algebra.
