7 citations · 44 across the 35 of their papers we have counts for
4 papers · 1 filter
On the Complexity of Digraph Colourings and Vertex Arboricity
Winfried Hochstättler, Felix Schröder, Raphael Steiner
It has been shown by Bokal et al. that deciding 2-colourability of digraphs is an NP-complete problem. This result was later on extended by Feder et al. to prove that deciding whet…
A Note On Universal Point Sets for Planar Graphs
Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner
We investigate which planar point sets allow simultaneous straight-line embeddings of all planar graphs on a fixed number of vertices. We first show that points are…
Sup-norm of Hecke-Laplace Eigenforms on
Raphael S. Steiner
We prove sub-convex bounds on the fourth moment of Hecke-Laplace eigenforms on . As a corollary, we get a bound on the sup-norm on an individual eigenform, which constitutes a…
The Star Dichromatic Number
Winfried Hochstättler, Raphael Steiner
We introduce a new notion of circular colourings for digraphs. The idea of this quantity, called star dichromatic number of a digraph , is to allow a finer subdi…