Tournament pathwidth and topological containment

DOI10.1016/J.JCTB.2013.03.001zbMath1301.05148OpenAlexW1984864893MaRDI QIDQ744161

P. D. Seymour, Alexandra Ovetsky Fradkin

Publication date: 6 October 2014

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.2013.03.001

zbMATH Keywords

tournamentspathwidthbundlesvertex-disjoint pathsjunglestopological containment

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

On the Pathwidth of Almost Semicomplete Digraphs ⋮ Directed width parameters on semicomplete digraphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ 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 ⋮ \(k\)-distinct in- and out-branchings in digraphs ⋮ 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 ⋮ Tournaments and Semicomplete Digraphs ⋮ Tournament minors

Cites Work

• Edge-disjoint paths in digraphs with bounded independence number
• Disjoint paths in tournaments
• The directed subgraph homeomorphism problem
• Jungles, bundles, and fixed-parameter tractability
• Unnamed Item

This page was built for publication: Tournament pathwidth and topological containment