Tournament immersion and cutwidth
From MaRDI portal
Publication:765193
Recommendations
Cites work
Cited in
(15)- Constructing graphs with no immersion of large complete graphs
- Jungles, bundles, and fixed-parameter tractability
- Characterizations and directed path-width of sequence digraphs
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments
- Recent techniques and results on the Erdős-Pósa property
- Tournament pathwidth and topological containment
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
- Hitting minors, subdivisions, and immersions in tournaments
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
- Comparing linear width parameters for directed graphs
- On width measures and topological problems on semi-complete digraphs
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- What's next? Future directions in parameterized complexity
- A well-quasi-order for tournaments
- Edge-disjoint paths in digraphs with bounded independence number
This page was built for publication: Tournament immersion and cutwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765193)