We give a constructive proof of the fact that the treewidth of a graph $G$ is bounded by a linear function of the separation number of $G$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。