Title

Some results on tree decomposition of graphs

Document Type

Article

Publication Date

1-1-1995

Abstract

We investigate tree decompositions (T,(Xt)tϵV(T)) whose width is “close to optimal” and such that all the subtrees of T induced by the vertices of the graph are “small.” We prove the existence of such decompositions for various interpretations of “close to optimal” and “small.” As a corollary of these results, we prove that the dilation of a graph is bounded by a logarithmic function of the congestion of the graph thereby settling a generalization of a conjecture of Bienstock. © 1995 John Wiley & Sons, Inc. Copyright © 1995 Wiley Periodicals, Inc., A Wiley Company

Publication Source (Journal or Book title)

Journal of Graph Theory

First Page

481

Last Page

499

This document is currently not available here.

Share

COinS