3 papers
math.CO2026
The balanced upper chromatic number of linear hypergraphs and the -cube over elements
Gabriela Araujo-Pardo, Silvia Fernández-Merchant, Adriana Hansberg +3
A coloring of the vertices of a hypergraph is called \emph{balanced} if the sizes of the color classes differ by at most one. We say that a hyperedge is \emph{rainbow} if its eleme…
math.CO2025
On the number of drawings of a combinatorial triangulation
Belén Cruces, Clemens Huemer, Dolores Lara
In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and additional vertices. In this n…
cs.CG2024
Sibson's formula for higher order Voronoi diagrams
Mercè Claverol, Andrea de las Heras-Parrilla, Clemens Huemer +1
Let be a set of points in general position in . The order- Voronoi diagram of , , is a subdivision of into cells whose points hav…