Biblio Discovery — Demo Discovery Service

2 hasil untuk "Marc Distel"

Menampilkan 1–2 · 0,54 detik · RSS

  1. Artikel Jurnal

    Improved product structure for graphs on surfaces

    Marc Distel; Robert Hickingbotham; Tony Huynh dkk.

    Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no 2, Iss Graph Theory… · 2022 · Inggris · DOAJ Scopus

    Dujmovi\'c, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved that for every graph $G$ with Euler genus $g$ there is a graph $H$ with treewidth at most 4 and a path $P$ such that $G\subseteq H \boxtimes P \boxtimes K_{\max\{2g,3\}}$. We improve this result by replacing "4" by "3" and with…

  2. Artikel Jurnal

    Treewidth 2 in the Planar Graph Product Structure Theorem

    Marc Distel; Kevin Hendrey; Nikolai Karol dkk.

    Discrete Mathematics & Theoretical Computer Science, Vol. vol. 27:2 No. Graph Theory · 2025 · Inggris · DOAJ Scopus

    We prove that every planar graph is contained in $H_1\boxtimes H_2\boxtimes K_2$ for some graphs $H_1$ and $H_2$ both with treewidth 2. This resolves a question of Liu, Norin and Wood [arXiv:2410.20333]. We also show this result is best possible: for any $c \in \mathbb{N}$, there is a planar graph…