Edge-disjoint paths in digraphs with bounded independence number
From MaRDI portal
Publication:473097
DOI10.1016/j.jctb.2014.07.002zbMath1302.05067OpenAlexW1988500978MaRDI QIDQ473097
Alexandra Ovetsky Fradkin, P. D. Seymour
Publication date: 21 November 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.2014.07.002
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (16)
On the Complexity of Singly Connected Vertex Deletion ⋮ Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs ⋮ On the Pathwidth of Almost Semicomplete Digraphs ⋮ Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 ⋮ Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number ⋮ Disjoint paths in unions of tournaments ⋮ Disjoint paths in tournaments ⋮ Tournament pathwidth and topological containment ⋮ 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 ⋮ Tournament immersion and cutwidth ⋮ Tournaments and Semicomplete Digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Digraphs of Bounded Width ⋮ On the complexity of singly connected vertex deletion ⋮ Non-separating spanning trees and out-branchings in digraphs of independence number 2
Cites Work
This page was built for publication: Edge-disjoint paths in digraphs with bounded independence number
