Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
From MaRDI portal
Publication:895993
DOI10.1016/j.jctb.2014.04.001zbMath1327.05269arXiv1305.4668MaRDI QIDQ895993
Reinhard Diestel, Johannes Carmesin, Fabian Hundertmark, Matthias Hamann
Publication date: 11 December 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.4668
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C40: Connectivity