Name
Abstract | ||
|---|---|---|
We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.jctb.2021.08.004 | Journal of Combinatorial Theory, Series B |
Keywords | DocType | Volume |
Graph,Canonical tree of tree-decomposition,Tangle,Profile,End | Journal | 152 |
ISSN | Citations | PageRank |
0095-8956 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Carmesin | 1 | 29 | 7.08 |
| Hamann Matthias | 2 | 0 | 0.34 |
| Miraftab Babak | 3 | 0 | 0.34 |