Bounding Connected Tree-Width

DOI10.1137/15M1044618zbMath1341.05025arXiv1503.01592OpenAlexW2963575312MaRDI QIDQ5741084

Daniel Weißauer, Matthias Hamann

Publication date: 22 July 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.01592

zbMATH Keywords

cycle spacetree-widthtree-decomposition

Mathematics Subject Classification ID

Trees (05C05) Graph minors (05C83) Distance in graphs (05C12) Connectivity (05C40)

Related Items (4)

Connected search for a lazy robber ⋮ Combining restarts, nogoods and bag-connected decompositions for solving csps ⋮ Algebraically grid-like graphs have large tree-width ⋮ Connected tree-width

Cites Work

• Connected tree-width
• Graph searching and a min-max theorem for tree-width
• Connected Treewidth and Connected Graph Searching
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounding Connected Tree-Width