An Excluded Grid Theorem for Digraphs with Forbidden Minors
From MaRDI portal
Publication:5383965
DOI10.1137/1.9781611973402.6zbMath1423.05160OpenAlexW4245052308MaRDI QIDQ5383965
Ken-ichi Kawarabayashi, Stephan Kreutzer
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.6
Related Items (5)
Towards the Graph Minor Theorems for Directed Graphs ⋮ Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ Adapting the Directed Grid Theorem into an FPT Algorithm ⋮ Matching connectivity: on the structure of graphs with perfect matchings ⋮ Unnamed Item
This page was built for publication: An Excluded Grid Theorem for Digraphs with Forbidden Minors
