30 citations · 64 across the 36 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
Two characterisations of accessible quasi-transitive graphs
Matthias Hamann, Babak Miraftab
We prove two characterisations of accessibility of locally finite quasi-transitive connected graphs. First, we prove that any such graph is accessible if and only if its set of…
math.CO2020
Canonical trees of tree-decompositions
Johannes Carmesin, Matthias Hamann, Babak Miraftab
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 struc…