3 papers
cs.CG2026
On the size of k-irreducible triangulations
Vincent Delecroix, Oscar Fontaine, Arnaud de Mesmay
A triangulation of a surface is k-irreducible if every non-contractible curve has length at least k and any edge contraction breaks this property. Equivalently, every edge belongs…
cs.CG2025
On the Computation of Schrijver's Kernels
Vincent Delecroix, Oscar Fontaine, Francis Lazarus
The geometry of a graph embedded on a closed oriented surface can be probed by counting the intersections of with closed curves on . Of special interest is the map $…
math.CO2025
On cuts of small chromatic number in sparse graphs
Guillaume Aubian, Marthe Bonamy, Romain Bourneuf +2
For a given integer , let denote the supremum such that every sufficiently large graph with average degree less than admits a separator $X \subseteq…