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 graphs that have small tree-width but large connected tree-width. We show that a graph has small connected tree-width if and only if it has small tree-width and contains no long geodesic cycle.
We further prove a connected analogue of the duality theorem for tree-width: a finite graph has small connected tree-width if and only if it has no bramble whose connected covers are all large. Both these results are qualitative: the bounds are good but not tight.
We show that graphs of connected tree-width k are k-hyperbolic, which is tight, and that graphs of tree-width k whose geodesic cycles all have length at most ℓ are ⌊3/2l(k-1)⌋-hyperbolic. The existence of such a function h(k, ℓ) had been conjectured by Sullivan.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. B. Adcock, B. D. Sullivan and M. W. Mahoney: Tree decompositions and social graphs, Internet Mathematics 12(5), 2016.
P. Bellenbaum and R. Diestel: Two short proofs concerning tree-decompositions, Comb., Probab. Comput. 11 (2002), 1–7.
V. Chepoi, F. Dragan, B. Estellon, M. Habib and Y. Vaxès: Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs, in: Proceedings of the twenty-fourth annual symposium on computational geometry, SCG’ 08, 59–68, New York, NY, USA, 2008. ACM.
R. Diestel: Graph Theory, Springer, 4th edition, 2010.
R. Diestel and S. Oum: Tangle-tree duality: in graphs, matroids and beyond, arXiv: 1701.02651, (2017)
Y. Dourisboure and C. Gavoille: Tree-decompositions with bags of small diameter, Discrete Math. 307 (2007), 2008–2029.
M. Hamann and D. Weissauer: Bounding connected tree-width, SIAM J. Discrete Math. 30 (2016), 1391–1400.
P. Jegou and C. Terrioux: Connected tree-width: a new parameter for graph decomposition, http://www.cs.uic.edu/pub/Isaim2014/WebPreferences/ISAIM2014_Jegou_Terrioux.pdf, 2014.
P. Jegou and C. Terrioux: Tree-decompositions with connected clusters for solving constraint networks, in CP 2014 (B. O’Sullivan, ed.), volume 8656, 403–407, Springer Lecture Notes in Computer Science, 2014.
M. Müller: Connected tree-width, arXiv:1211.7353, 2012.
P. Seymour and R. Thomas: Graph searching and a min-max theorem for treewidth, J. Combin. Theory (Series B) 58 (1993), 22–33.
B. Sullivan: Personal communication, Dagstuhl 2013.
R. Thomas: A Menger-like property of tree-width; the finite case, J. Combin. Theory (Series B) 48 (1990), 67–76.
