research
∙
12/19/2022
Excluding Single-Crossing Matching Minors in Bipartite Graphs
By a seminal result of Valiant, computing the permanent of (0,1)-matrice...
share
research
∙
10/14/2021
A Flat Wall Theorem for Matching Minors in Bipartite Graphs
A major step in the graph minors theory of Robertson and Seymour is the ...
research
∙
10/05/2021
Two Disjoint Alternating Paths in Bipartite Graphs
A bipartite graph B is called a brace if it is connected and every match...
research
∙
06/01/2021
Excluding a Planar Matching Minor in Bipartite Graphs
Matching minors are a specialisation of minors fit for the study of grap...
research
∙
03/02/2021
Block Elimination Distance
We introduce the block elimination distance as a measure of how close a ...
research
∙
09/28/2020
The canonical directed tree decomposition and its applications to the directed disjoint paths problem
The canonical tree-decomposition theorem, given by Robertson and Seymour...
research
∙
02/17/2019
Braces of Perfect Matching Width 2
A graph G is called matching covered if it is connected and every edge i...
research
∙
08/02/2018