Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
1 answer
610 views

Directed graph minor theorems

In proving the graph minor theorem, Robertson and Seymour proved a stronger statement, namely that the directed graph minor theorem is true, using the definition A directed graph is a minor of ...
Stella Biderman's user avatar
6 votes
1 answer
124 views

Characterizing SP-DAGs by Forbidden Minors?

So it's well-known that an alternative way to define a series-parallel (undirected graph) is by the forbidden minor $K_4$. Is there a known analog of this definition for directed graphs — ...
Daisy Sophia Hollman's user avatar