Search Results - "Hatzel, Meike"

Tight Bound on Treedepth in Terms of Pathwidth and Longest Path by Hatzel, Meike, Joret, Gwenaël, Micek, Piotr, Pilipczuk, Marcin, Ueckerdt, Torsten, Walczak, Bartosz

“…We show that every graph with pathwidth strictly less than a that contains no path on 2 b vertices as a subgraph has treedepth at most 10 ab . The bound is…”
Get full text

Constant Congestion Brambles by Hatzel, Meike, Komosa, Pawel, Pilipczuk, Marcin, Sorge, Manuel

“…A bramble in an undirected graph $G$ is a family of connected subgraphs of $G$ such that for every two subgraphs $H_1$ and $H_2$ in the bramble either $V(H_1)…”
Get full text

Tuza's Conjecture for Threshold Graphs by Bonamy, Marthe, Bożyk, Łukasz, Grzesik, Andrzej, Hatzel, Meike, Masařík, Tomáš, Novotná, Jana, Okrasa, Karolina

“…Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph…”
Get full text

Encoding CSP into CCS by Hatzel, Meike, Wagner, Christoph, Peters, Kirstin, Nestmann, Uwe

“…We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous pi-calculus. By doing so, we discuss two…”
Get full text

Dualities in Graphs and Digraphs by Hatzel, Meike

“…In this thesis we describe dualities in directed as well as undirected graphs based on tools such as width-parameters, obstructions and substructures. We…”
Get full text

Graphs with at most two moplexes by Dallard, Clément, Ganian, Robert, Hatzel, Meike, Krnc, Matjaž, Milanič, Martin

“…A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. The notion is known to be…”
Get full text

On tree decompositions whose trees are minors by Blanco, Pablo, Cook, Linda, Hatzel, Meike, Hilaire, Claire, Illingworth, Freddie, McCarty, Rose

“…In 2019, Dvořák asked whether every connected graph G $G$ has a tree decomposition ( T , B ) $(T,{\rm{ {\mathcal B} }})$ so that T $T$ is a subgraph of G $G$…”
Get full text

Avoidable Paths in Graphs by Bonamy, Marthe, Defrain, Oscar, Hatzel, Meike, Thiebaut, Jocelyn

“…We prove a recent conjecture of Beisegel et al. that for every positive integer $k$, every graph containing an induced $P_k$ also contains an avoidable $P_k$…”
Get full text

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games by Hatzel, Meike, Schröder, Johannes

“…Treewidth on undirected graphs is known to have many algorithmic applications. When considering directed width-measures there are much less results on their…”
Get full text

Counterexample to Babai's lonely colour conjecture by Davies, James, Hatzel, Meike, Yepremyan, Liana

“…Motivated by colouring minimal Cayley graphs, in 1978, Babai conjectured that no-lonely-colour graphs have bounded chromatic number. We disprove this in a…”
Get full text

Erd\H{o}s-P\'osa property of tripods in directed graphs by Briański, Marcin, Hatzel, Meike, Okrasa, Karolina, Pilipczuk, Michał

“…Let $D$ be a directed graphs with distinguished sets of sources $S\subseteq V(D)$ and sinks $T\subseteq V(D)$. A tripod in $D$ is a subgraph consisting of the…”
Get full text

Unavoidable induced subgraphs in graphs with complete bipartite induced minors by Chudnovsky, Maria, Hatzel, Meike, Korhonen, Tuukka, Trotignon, Nicolas, Wiederrecht, Sebastian

“…We prove that if a graph contains the complete bipartite graph $K_{134, 12}$ as an induced minor, then it contains a cycle of length at most~12 or a theta as…”
Get full text

Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem by Hatzel, Meike, Kreutzer, Stephan, Milani, Marcelo Garlet, Muzi, Irene

“…In 2015, Kawarabayashi and Kreutzer proved the directed grid theorem confirming a conjecture by Reed, Johnson, Robertson, Seymour, and Thomas from the…”
Get full text

Generating strongly 2-connected digraphs by Hatzel, Meike, Kreutzer, Stephan, Protopapas, Evangelos, Reich, Florian, Stamoulis, Giannos, Wiederrecht, Sebastian

“…We prove that there exist four operations such that given any two strongly $2$-connected digraphs $H$ and $D$ where $H$ is a butterfly-minor of $D$, there…”
Get full text

Simpler and faster algorithms for detours in planar digraphs by Hatzel, Meike, Majewski, Konrad, Pilipczuk, Michał, Sokołowski, Marek

“…In the directed detour problem one is given a digraph $G$ and a pair of vertices $s$ and~$t$, and the task is to decide whether there is a directed simple path…”
Get full text

Half-integral Erd\H{o}s-P\'{o}sa property for non-null $S$-$T$ paths by Chekan, Vera, Geniet, Colin, Hatzel, Meike, Pilipczuk, Michał, Sokołowski, Marek, Seweryn, Michał T, Witkowski, Marcin

“…For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that…”
Get full text

Constant Congestion Brambles by Hatzel, Meike, Komosa, Pawel, Pilipczuk, Marcin, Sorge, Manuel

“…Discrete Mathematics & Theoretical Computer Science, vol. 24, no. 1, Graph Theory (March 31, 2022) dmtcs:6699 A bramble in an undirected graph $G$ is a family…”
Get full text

Tight bound on treedepth in terms of pathwidth and longest path by Hatzel, Meike, Joret, Gwenaël, Micek, Piotr, Pilipczuk, Marcin, Ueckerdt, Torsten, Walczak, Bartosz

“…Combinatorica, 44:417--427, 2024 We show that every graph with pathwidth strictly less than $a$ that contains no path on $2^b$ vertices as a subgraph has…”
Get full text

Decomposition of (infinite) digraphs along directed 1-separations by Bowler, Nathan, Gut, Florian, Hatzel, Meike, Kawarabayashi, Ken-ichi, Muzi, Irene, Reich, Florian

“…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…”
Get full text

Graphs with at most two moplexes by Dallard, Clément, Ganian, Robert, Hatzel, Meike, Krnc, Matjaž, Milanič, Martin

“…A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. While every non-complete graph…”
Get full text