Pages that link to "Item:Q1034635"
From MaRDI portal
The following pages link to Disjoint directed and undirected paths and cycles in digraphs (Q1034635):
Displaying 19 items.
- Vertex-disjoint directed and undirected cycles in general digraphs (Q402588) (← links)
- Arc-disjoint spanning sub(di)graphs in digraphs (Q441857) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Digraphs without directed path of length two or three (Q1068100) (← links)
- On digraphs with no two disjoint directed cycles (Q1092919) (← links)
- On the problem of finding disjoint cycles and dicycles in a digraph (Q2428634) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Arc-disjoint paths and trees in 2-regular digraphs (Q2444565) (← links)
- Disjoint \(A\)-paths in digraphs (Q2565693) (← links)
- Arc-disjoint directed and undirected cycles in digraphs (Q2833257) (← links)
- Disjoint sub(di)graphs in digraphs (Q2851460) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs (Q3797196) (← links)
- (Q4568185) (← links)
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) (← links)
- Finding an induced subdivision of a digraph (Q5891097) (← links)
- Cycle-connected mixed graphs and related problems (Q5918609) (← links)