Name
Abstract | ||
|---|---|---|
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject to the requirement that they commute with graph isomorphisms. In particular, all the decompositions constructed are invariant under the automorphisms of the graph. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jctb.2014.04.001 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Graph,Connectivity,Tree-decomposition,k-block,Tangle,Profile,Tutte-decomposition | Discrete mathematics,Combinatorics,Comparability graph,Line graph,Forbidden graph characterization,Graph property,Partial k-tree,Algorithm,Cograph,Pathwidth,Universal graph,Mathematics | Journal |
Volume | ISSN | Citations |
116 | 0095-8956 | 7 |
PageRank | References | Authors |
0.95 | 4 | 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 |