48 citations · 133 across the 27 of their papers we have counts for
4 papers · 1 filter
10-tough chordal graphs are Hamiltonian
Adam Kabela, Tomáš Kaiser
Chen et al. proved that every 18-tough chordal graph has a Hamilton cycle [Networks 31 (1998), 29-38]. Improving upon their bound, we show that every 10-tough chordal graph is Hami…
Weak regularity and finitely forcible graph limits
Jacob W. Cooper, Tomas Kaiser, Daniel Kral +1
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determine…
Planar graphs have two-coloring number at most 8
Zdeněk Dvořák, Adam Kabela, Tomáš Kaiser
We prove that the two-colouring number of any planar graph is at most 8. This resolves a question of Kierstead et al. [SIAM J. Discrete Math.~23 (2009), 1548--1560]. The result is…
First order limits of sparse graphs: Plane trees and path-width
Jakub Gajarsky, Petr Hlineny, Tomas Kaiser +5
Nesetril and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there…