Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Marc Distel"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no 2, Iss Graph Theory (2022)
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 imp
Externí odkaz:
https://doaj.org/article/3d827bc07849483c8334d4642b97daf4
