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

DOI10.1007/978-3-030-30786-8_5MaRDI QIDQ2301534zbMATH OpenOpenAlexFDO

Authors Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht

Publication date 24 February 2020

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

zbMATH Keywords

branch decompositiondirected treewidthmatching minorperfect matching

Mathematics Subject Classification ID

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

Recommendations

• Matching minors in bipartite graphs
• Excluding a planar matching minor in bipartite graphs
• Characterizing graphs of maximum matching width at most 2
• Perfect matchings. A theory of matching covered graphs (to appear)

Cited in

(7)

• Digraphs of directed treewidth one
• Excluding a planar matching minor in bipartite graphs
• Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
• Matching minors in bipartite graphs
• Braces of perfect matching width 2
• Hitting cycles through prescribed vertices or edges
• An overview of universal obstructions for graph parameters

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301534)