10 citations · 12 across the 2 of their papers we have counts for
6 papers
Circumference of essentially 4-connected planar triangulations
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A -connected graph is essentially -connected if, for any -cut of , at most one component of contains at least two vertices. We prove that ev…
Random perturbation of sparse graphs
Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge +2
In the model of randomly perturbed graphs we consider the union of a deterministic graph with minimum degree and the binomial random graph . T…
A Construction of Uniquely Colourable Graphs with Equal Colour Class Sizes
Samuel Mohr
A uniquely -colourable graph is a graph with exactly one partition of the vertex set into at most colour classes. Here, we investigate some constructions of uniquely -col…
Long Cycles and Spanning Subgraphs of Locally Maximal 1-planar Graphs
Igor Fabrici, Jochen Harant, Tomáš Madaras +3
A graph is -planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for e…
On the Circumference of Essentially 4-connected Planar Graphs
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A planar graph is essentially -connected if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Jackson and Wormald proved that every essenti…
Rooted complete minors in line graphs with a Kempe coloring
Matthias Kriesell, Samuel Mohr
It has been conjectured that if a finite graph has a vertex coloring such that the union of any two color classes induces a connected graph, then for every set of vertices cont…