Meike Hatzel

most citedDecomposition of (infinite) digraphs along directed 1-separations

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2024

Half-integral Erdős-Pósa property for non-null $S$ - $T$ paths

Vera Chekan, Colin Geniet, Meike Hatzel +4

For a group $Γ$ , a $Γ$ -labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $Γ$ so that opposite orientations of the same edge are…

math.CO2023★ 1 cited

Decomposition of (infinite) digraphs along directed 1-separations

Nathan Bowler, Florian Gut, Meike Hatzel +3

We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the s…

math.CO2023

On tree decompositions whose trees are minors

Pablo Blanco, Linda Cook, Meike Hatzel +3

In 2019, Dvořák asked whether every connected graph $G$ has a tree decomposition $(T, B)$ so that $T$ is a subgraph of $G$ and the width of $(T, B)$ is bounded…

Half-integral Erdős-Pósa property for non-null S-T paths

Decomposition of (infinite) digraphs along directed 1-separations

On tree decompositions whose trees are minors

Half-integral Erdős-Pósa property for non-null $S$ - $T$ paths