48 citations · 133 across the 27 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013★ 15 cited
Colouring quadrangulations of projective spaces
Tomáš Kaiser, Matěj Stehlík
A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G w…
cs.DS2013
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Hajo Broersma, Jiří Fiala, Petr A. Golovach +3
Hung and Chang showed that for all k>=1 an interval graph has a path cover of size at most k if and only if its scattering number is at most k. They also showed that an interval gr…
math.CO2013★ 48 cited
Replication in critical graphs and the persistence of monomial ideals
Tomáš Kaiser, Matěj Stehlík, Riste Škrekovski
Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., cri…