48 citations · 169 across the 56 of their papers we have counts for
45 papers · 1 filter
Asymptotic connectivity, hamiltonicity and toughness
Agelos Georgakopoulos
We define coarse variants of the notions of connectivity, hamiltonicity, toughness, and spanning trees. Our notions are invariant under quasi-isometries, and they obey the same rel…
Quasi-isometries, contractions, and intersection graphs
Agelos Georgakopoulos, Chiara Molinari
We prove that a graph is quasi-planar - i.e. quasi-isometric to a planar graph - if and only if it can be obtained by iterating the following two operations a bounded number of…
A coarse block-cutvertex tree-decomposition
Sandra Albrechtsen, Agelos Georgakopoulos
We obtain a coarse version of the block-cutvertex tree-decomposition of a connected graph.
Small counterexamples to the fat minor conjecture
Sandra Albrechtsen, Marc Distel, Agelos Georgakopoulos
We narrow the gap between the family of graphs that do and the family of graphs that do not satisfy the fat minor conjecture by obtaining much simpler counterexamples than were pre…
On better-quasi-ordering under graph minors
Agelos Georgakopoulos
In the aftermath of the Robertson--Seymour Graph Minor Theorem, Thomas conjectured that the countable graphs are well-quasi-ordered under the minor relation. We prove that this con…
Excluding as a fat minor
Sandra Albrechtsen, Marc Distel, Agelos Georgakopoulos
We prove that for every , the graph satisfies the fat minor conjecture of Georgakopoulos and Papasoglu: for every there exist $M,A\in…