On tree decompositions whose trees are minors
JOURNAL OF GRAPH THEORY(2024)
摘要
In 2019, Dvorak 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$ and the width of ( T , B ) $(T,{\rm{ {\mathcal B} }})$ is bounded by a function of the treewidth of G $G$. We prove that this is false, even when G $G$ has treewidth 2 and T $T$ is allowed to be a minor of G $G$.
更多查看译文
关键词
minors,tree decomposition,treewidth
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要