1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
2. Directed tree-width examples;Adler;J. Combin. Theory Ser. B,2007
3. A complete axiomatisation of the inclusion of series-parallel partial orders;Bechet,1997
4. The dag-width of directed graphs;Berwangera;J. Combin. Theory Ser. B,2012
5. Digraphs. Theory, Algorithms and Applications;Bang-Jensen,2009