10 citations · 12 across the 3 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
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…
math.CO2018
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…