8 citations · 25 across the 33 of their papers we have counts for
3 papers · 1 filter
Avoidable paths in graphs
Marthe Bonamy, Oscar Defrain, Meike Hatzel +1
We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises th…
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based…
Braces of Perfect Matching Width 2
Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaf…