The following pages link to The Directed Grid Theorem (Q2941561):
Displayed 25 items.
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Packing \(A\)-paths of length zero modulo four (Q2237857) (← links)
- Subdivisions in digraphs of large out-degree or large dichromatic number (Q2315440) (← links)
- Euler Digraphs (Q3120436) (← links)
- Planar Digraphs (Q3120437) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- Even circuits in oriented matroids (Q5052170) (← links)
- Constant Congestion Brambles in Directed Graphs (Q5071097) (← links)
- (Q5075819) (← links)
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree (Q5084095) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Half-integral linkages in highly connected directed graphs (Q5111723) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Complete directed minors and chromatic number (Q6046643) (← links)
- Cut-sufficient directed 2-commodity multiflow topologies (Q6086019) (← links)
- Detours in directed graphs (Q6113279) (← links)
- Excluding a planar matching minor in bipartite graphs (Q6144397) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)