12 citations · 47 across the 20 of their papers we have counts for
4 papers · 1 filter
A Flat Wall Theorem for Matching Minors in Bipartite Graphs
Archontia C. Giannopoulou, Sebastian Wiederrecht
A major step in the graph minors theory of Robertson and Seymour is the transition from the Grid Theorem which, in some sense uniquely, describes areas of large treewidth within a…
Two Disjoint Alternating Paths in Bipartite Graphs
Archontia C. Giannopoulou, Sebastian Wiederrecht
A bipartite graph B is called a brace if it is connected and every matching of size at most two in B is contained in some perfect matching of B and a cycle C in B is called conform…
Excluding a Planar Matching Minor in Bipartite Graphs
Archontia C Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Matching minors are a specialisation of minors fit for the study of graph with perfect matchings. The notion of matching minors has been used to give a structural description of bi…
Block Elimination Distance
Öznur Yaşar Diner, Archontia C. Giannopoulou, Giannos Stamoulis +1
We introduce the block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class , the class ${\cal B}({\cal…