Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Canonical tree-decompositions of finite graphs I. Existence and algorithms;Carmesin;J. Combin. Theory Ser. B,2016
2. Canonical tree-decompositions of finite graphs II. Essential parts;Carmesin;J. Combin. Theory Ser. B,2016
3. Connectivity and tree structure in finite graphs;Carmesin;Combinatorica,2014
4. R. Diestel, Open problems about canonical tree-decompositions of graphs and width parameter duality, presentation at Hamburg workshop on graphs and matroids, Spiekeroog, 2014.
5. Graph Theory;Diestel,2010
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Entanglements;Journal of Combinatorial Theory, Series B;2024-01
2. Canonical decompositions of 3-connected graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Canonical trees of tree-decompositions;Journal of Combinatorial Theory, Series B;2022-01
4. Structural submodularity and tangles in abstract separation systems;Journal of Combinatorial Theory, Series A;2019-10
5. A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors;SIAM Journal on Discrete Mathematics;2019-01