Abstract
The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of g......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
