research
∙
04/10/2023
Approximating branchwidth on parametric extensions of planarity
The branchwidth of a graph has been introduced by Roberson and Seymour a...
share
research
∙
04/10/2023
Odd-Minors I: Excluding small parity breaks
Given an annotated graph class 𝒞, the 𝒞-blind-treewidth of a graph G is ...
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...
research
∙
07/14/2022
Kernelization for Graph Packing Problems via Rainbow Matching
We introduce a new kernelization tool, called rainbow matching technique...
research
∙
07/11/2022
Killing a Vortex
The Structural Theorem of the Graph Minors series of Robertson and Seymo...
research
∙
02/23/2022
Matching Theory and Barnette's Conjecture
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipart...
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
∙
10/18/2020
Even Circuits in Oriented Matroids
In this paper we generalise the even directed cycle problem, which asks ...
research
∙
10/04/2019
A Note on Directed Treewidth
We characterise digraphs of directed treewidth one in terms of forbidden...
research
∙
05/30/2019
Parametrised Algorithms for Directed Modular Width
Many well-known NP-hard algorithmic problems on directed graphs resist e...
research
∙
03/07/2019
Colouring Non-Even Digraphs
A colouring of a digraph as defined by Erdos and Neumann-Lara in 1980 is...
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
∙
02/04/2019
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
A connected graph G is called matching covered if every edge of G is con...
research
∙
05/15/2018
