12 citations · 34 across the 21 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022★ 3 cited
The immersion-minimal infinitely edge-connected graph
Paul Knappe, Jan Kurkofka
We show that there is a unique immersion-minimal infinitely edge-connected graph: every such graph contains the halved Farey graph, which is itself infinitely edge-connected, as an…
math.CO2022★ 2 cited
Canonical graph decompositions via coverings
Reinhard Diestel, Raphael W. Jacobs, Paul Knappe +1
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degre…
math.CO2022★ 2 cited
Entanglements
Johannes Carmesin, Jan Kurkofka
Robertson and Seymour constructed for every graph a tree-decomposition that efficiently distinguishes all the tangles in . While all previous constructions of these decompos…