Tournament immersion and cutwidth

DOI10.1016/j.jctb.2011.05.001zbMath1241.05040OpenAlexW1992867801MaRDI QIDQ765193

P. D. Seymour, Maria Chudnovsky, Alexandra Ovetsky 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

zbMATH Keywords

immersiontournamentcutwidth

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

What’s Next? Future Directions in Parameterized Complexity ⋮ Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments ⋮ Constructing Graphs with No Immersion of Large Complete Graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Characterizations and directed path-width of sequence digraphs ⋮ On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments ⋮ A well-quasi-order for tournaments ⋮ Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number ⋮ Edge-disjoint paths in digraphs with bounded independence number ⋮ Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number ⋮ On width measures and topological problems on semi-complete digraphs ⋮ Comparing linear width parameters for directed graphs

Cites Work

• Edge-disjoint paths in digraphs with bounded independence number
• A well-quasi-order for tournaments
• The directed subgraph homeomorphism problem

This page was built for publication: Tournament immersion and cutwidth