Directed Graph Embeddings.

Definitions of graph embeddings and graph minors for directed graphs are introduced. For the class of 2-terminal directed acyclic graphs (TDAGs) the definitions coincide, and the class is closed under both operations. The usefulness of the directed embedding operation is demonstrated be characterizing all TDAGs with parallel-width at most $k$, which generalizes earlier characterizations of series-parallel graphs.