4 citations · 7 across the 3 of their papers we have counts for
3 papers
Canonical tree-decompositions of finite graphs II. Essential parts
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
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 es…
Canonical tree-decompositions of finite graphs I. Existence and algorithms
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
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…
Dominating functions and graphs
Reinhard Diestel, Saharon Shelah, Juris Steprāns
A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels…