8 citations · 25 across the 33 of their papers we have counts for
10 papers · 2 filters
Unavoidable butterfly minors in digraphs of large cycle rank
Meike Hatzel, O-joung Kwon, Myounghwan Lee +1
Cycle rank is one of the depth parameters for digraphs introduced by Eggan in 1963. We show that there exists a function such that every digraph of cyc…
The Erdős-Pósa property for circle graphs as vertex-minors
Rutger Campbell, J. Pascal Gollin, Meike Hatzel +4
We prove that for any circle graph with at least one edge and for any positive integer , there exists an integer so that every graph either has a vertex-minor…
Odd coloring graphs with linear neighborhood complexity
James Davies, Meike Hatzel, Kolja Knauer +2
We prove that any class of graphs with linear neighborhood complexity has bounded improper odd chromatic number. As a result, if is the class of all circle graphs, or…
Girth in -representable matroids
James Davies, Meike Hatzel, Kolja Knauer +2
We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field and any integer , every cosimple -representable matroid with sufficiently large gi…
On graphs with a simple structure of maximal cliques
J. Pascal Gollin, Meike Hatzel, Sebastian Wiederrecht
We say that a hereditary graph class is \emph{clique-sparse} if there is a constant such that for every graph , every vertex of $G…
Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
James Davies, Agelos Georgakopoulos, Meike Hatzel +1
In this paper, we consider the class of sphere intersection graphs in for . We show that for each integer , the class of all graphs in $…
Directed treewidth is closed under taking butterfly minors
Gunwoo Kim, Meike Hatzel, Stephan Kreutzer
Butterfly minors are a generalisation of the minor containment relation for undirected graphs to directed graphs. Many results in directed structural graph theory use this notion a…
Quasi-isometries between graphs with variable edge lengths
James Davies, Meike Hatzel, Robert Hickingbotham
This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allo…
On graphs coverable by chubby shortest paths
Meike Hatzel, Michał Pilipczuk
Dumas, Foucaud, Perez, and Todinca [SIAM J. Disc. Math., 2024] proved that if the vertex set of a graph can be covered by shortest paths, then the pathwidth of is bound…
Bounds on treewidth via excluding disjoint unions of cycles
Meike Hatzel, Chun-Hung Liu, Bruce Reed +1
One of the fundamental results in graph minor theory is that for every planar graph~, there is a minimum integer~ such that graphs with no minor isomorphic to~ have tre…