10 citations · 20 across the 11 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Strong modeling limits of graphs with bounded tree-width
Andrzej Grzesik, Daniel Kráľ, Samuel Mohr
The notion of first order convergence of graphs unifies the notions of convergence for sparse and dense graphs. Nešetřil and Ossona de Mendez [J. Symbolic Logic 84 (2019), 452-472]…
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…