10 citations · 12 across the 2 of their papers we have counts for
3 papers
math.CO2021★ 2 cited
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…
math.CO2019★ 10 cited
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…
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…