Tournament immersion and cutwidth
From MaRDI portal
Publication:765193
DOI10.1016/J.JCTB.2011.05.001zbMATH Open1241.05040OpenAlexW1992867801MaRDI QIDQ765193FDOQ765193
Authors: Maria Chudnovsky, Paul Seymour, Alexandra Fradkin 
Publication date: 19 March 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.05.001
Recommendations
Cites Work
Cited In (15)
- A well-quasi-order for tournaments
- Hitting minors, subdivisions, and immersions in tournaments
- What's next? Future directions in parameterized complexity
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments
- Characterizations and directed path-width of sequence digraphs
- 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
- Tournament pathwidth and topological containment
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- Jungles, bundles, and fixed-parameter tractability
- Edge-disjoint paths in digraphs with bounded independence number
- Constructing graphs with no immersion of large complete graphs
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
- Recent techniques and results on the Erdős-Pósa property
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)
