Tournament pathwidth and topological containment
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- k-distinct in- and out-branchings in digraphs
- Directed width parameters on semicomplete digraphs
- On width measures and topological problems on semi-complete digraphs
- Tournament minors
- Recent techniques and results on the Erdős-Pósa property
- Tournaments and Semicomplete Digraphs
- On the pathwidth of almost semicomplete digraphs
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
- Jungles, bundles, and fixed-parameter tractability
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
- First order logic and twin-width in tournaments and dense oriented graphs
- Polynomial kernel for immersion hitting in tournaments
- Revisiting directed disjoint paths on tournaments (and relatives)
- Tournament immersion and cutwidth
This page was built for publication: Tournament pathwidth and topological containment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744161)