Polynomial Planar Directed Grid Theorem

DOI10.1137/1.9781611975482.89zbMath1434.05147OpenAlexW4252529633MaRDI QIDQ5236273

Stephan Kreutzer, Ken-ichi Kawarabayashi, Meike Hatzel

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.89

zbMATH Keywords

Eulerian subgraphdirected treewidthdirected grids

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Constant Congestion Brambles in Directed Graphs ⋮ Adapting the Directed Grid Theorem into an FPT Algorithm ⋮ Unnamed Item

This page was built for publication: Polynomial Planar Directed Grid Theorem