Name
Abstract | ||
|---|---|---|
In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish lower bounds on the number of parts in these decompositions that contain such a block or tangle, and determine conditions under which such parts contain nothing but a k-block. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jctb.2014.12.009 | Journal of Combinatorial Theory Series B |
Keywords | Field | DocType |
tree decomposition,minor,tangle,graph | Discrete mathematics,Tangle,Graph,Combinatorics,Nothing,Tree decomposition,Mathematics | Journal |
Volume | Issue | ISSN |
118 | C | 0095-8956 |
Citations | PageRank | References |
2 | 0.39 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Carmesin | 1 | 29 | 7.08 |
| Reinhard Diestel | 2 | 452 | 68.24 |
| Matthias Hamann | 3 | 16 | 3.43 |
| Fabian Hundertmark | 4 | 17 | 2.77 |