Name
Abstract | ||
|---|---|---|
We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem for more general combina- torial structures, which has further applications. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s00493-017-3595-y | Combinatorica |
Keywords | Field | DocType |
05C05, 05C40, 05C83, 05B35, 06A07 | Matroid,Discrete mathematics,Combinatorics,Oriented matroid,k-edge-connected graph,Matroid partitioning,Dual graph,Graphic matroid,Weighted matroid,Mathematics,Branch-decomposition | Journal |
Volume | Issue | ISSN |
39 | 1 | 1439-6912 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Reinhard Diestel | 1 | 452 | 68.24 |
| Fabian Hundertmark | 2 | 17 | 2.77 |
| Sahar Lemanczyk | 3 | 0 | 0.34 |