Cyclewidth and the grid theorem for perfect matching width of bipartite graphs

DOI10.1007/978-3-030-30786-8_5OpenAlexW2973845735MaRDI QIDQ2301534

Sebastian Wiederrecht, Roman Rabinovich, Meike Hatzel

Publication date: 24 February 2020

Full work available at URL: https://arxiv.org/abs/1902.01322

zbMATH Keywords

perfect matchingdirected treewidthbranch decompositionmatching minor

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Excluding a planar matching minor in bipartite graphs ⋮ Digraphs of directed treewidth one

This page was built for publication: Cyclewidth and the grid theorem for perfect matching width of bipartite graphs