Pages that link to "Item:Q473097"
From MaRDI portal
The following pages link to Edge-disjoint paths in digraphs with bounded independence number (Q473097):
Displaying 24 items.
- Disjoint paths in tournaments (Q481696) (← links)
- Tournament pathwidth and topological containment (Q744161) (← links)
- Tournament immersion and cutwidth (Q765193) (← links)
- The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint (Q1346794) (← links)
- Disjoint paths in unions of tournaments (Q1719586) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Non-separating spanning trees and out-branchings in digraphs of independence number 2 (Q2102758) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- On the Pathwidth of Almost Semicomplete Digraphs (Q3452843) (← links)
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs (Q3797196) (← links)
- (Q3999955) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs (Q5042259) (← links)
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) (← links)
- Edge Disjoint Paths in Moderately Connected Graphs (Q5893911) (← links)
- LATIN 2004: Theoretical Informatics (Q5901632) (← links)
- Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 (Q6081563) (← links)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)
- Quick-sort style approximation algorithms for generalizations of feedback vertex set in tournaments (Q6547935) (← links)
