The following pages link to Finding a subdivision of a digraph (Q476873):
Displaying 5 items.
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- DAG-width and circumference of digraphs (Q2811203) (← links)
- Splitting digraphs (Q3419770) (← links)
- Finding an induced subdivision of a digraph (Q5891097) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
