Raphael Steiner

activity

20242026

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Defective coloring of blowups

Sergey Norin, Raphael Steiner

Given a graph $G$ and an integer $d \geq 0$ , its $d$ -defective chromatic number $χ^{d} (G)$ is the smallest size of a partition of the vertices into parts inducing subgraphs with maximu…

cs.CG2025

Geometric realizations of dichotomous ordinal graphs

Patrizio Angelini, Sabine Cornelsen, Carolina Haase +5

A dichotomous ordinal graph consists of an undirected graph with a partition of the edges into short and long edges. A geometric realization of a dichotomous ordinal graph $G$ in a…