43 citations · 147 across the 33 of their papers we have counts for
6 papers · 1 filter
Characterising graphs with no subdivision of a wheel of bounded diameter
Johannes Carmesin
We prove that a graph has an r-bounded subdivision of a wheel if and only if it does not have a graph-decomposition of locality r and width at most two.
Local 2-separators
Johannes Carmesin
How can sparse graph theory be extended to large networks, where algorithms whose running time is estimated using the number of vertices are not good enough? I address this questio…
A Whitney type theorem for surfaces: characterising graphs with locally planar embeddings
Johannes Carmesin
We prove that for any parameter r an r-locally 2-connected graph G embeds r-locally planarly in a surface if and only if a certain matroid associated to the graph G is co-graphic.…
Large highly connected subgraphs in graphs with linear average degree
Johannes Carmesin
In 1972 Mader proved that every graph with average degree at least has a -connected subgraph with more than vertices. We improve this bound by showing that the con…
New Constructions related to the Polynomial Sphere Recognition Problem
Johannes Carmesin, Lyuben Lichev
We construct a simply connected complex embeddable in space such that for any embedding of in , any edge contraction forms a minor of the complex n…
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…