关于$k$ -树的书厚
On the book thickness of $k$-trees
摘要:
每个$k$ -树的书厚最多为$k+1$,并且这个界限对于所有$k\geq3$都是最好的。Vandenbussche等人(2009)证明了每个具有光滑度为3的树分解且宽度为$k$的$k$ -树最多有$k$的书厚。我们证明了这个结果是最好的可能为$k\geq 4$,通过构建一个$k$ -树的书厚$k+1$,有一个光滑的度-4树分解的宽度$k$。这解决了Vandenbussche等人(2009)的一个公开问题。
英文摘要:
Every $k$-tree has book thickness at most $k+1$, and this bound is best possible for all $k\geq3$. Vandenbussche et al. (2009) proved that every $k$-tree that has a smooth degree-3 tree decomposition with width $k$ has book thickness at most $k$. We prove this result is best possible for $k\geq 4$, by constructing a $k$-tree with book thickness $k+1$ that has a smooth degree-4 tree decomposition with width $k$. This solves an open problem of Vandenbussche et al. (2009)
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。