arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.3401math.CO
收藏

与树宽相关的参数

Parameters Tied to Treewidth

Daniel J. Harvey, David R. Wood

摘要:

树宽是算法和结构图论的一个基本重要的图形参数。本文综述了与树宽相关的几个图参数,包括分离数、缠结数、良好链接数和笛卡尔树乘积数。我们回顾了文献中的许多结果,表明这些参数与树宽有关。在一些情况下,我们还提高了已知的界限,提供更简单的证明,并表明,提出的不等式是紧的。

英文摘要:

Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This paper surveys several graph parameters tied to treewidth, including separation number, tangle number, well-linked number and Cartesian tree product number. We review many results in the literature showing these parameters are tied to treewidth. In a number of cases we also improve known bounds, provide simpler proofs and show that the inequalities presented are tight.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑