Publications (84)
Chromatic number and regular subgraphs
Barnabás Janzer, Raphael Steiner, Benny Sudakov
Coloring Drawings of Graphs
Christoph Hertrich, Felix Schröder, Raphael Steiner
Colorings of oriented planar graphs avoiding a monochromatic subgraph
Helena Bergold, Winfried Hochstättler, Raphael Steiner
Improved lower bound for the list chromatic number of graphs with no $K_t$ minor
Raphael Steiner
Complete minors in digraphs with given dichromatic number
Tamás Mészáros, Raphael Steiner
Complete Acyclic Colorings
Stefan Felsner, Winfried Hochstättler, Kolja Knauer +1
Clustered Colouring of Odd-$H$-Minor-Free Graphs
Robert Hickingbotham, Dong Yeap Kang, Sang-il Oum +2
Long cycles in vertex transitive digraphs
Matija BuciÄ, Kevin Hendrey, Bojan Mohar +2
Even Circuits in Oriented Matroids
Karl Heuer, Raphael Steiner, Sebastian Wiederrecht
Parametrised Algorithms for Directed Modular Width
Raphael Steiner, Sebastian Wiederrecht
Tight bounds for divisible subdivisions
Shagnik Das, Nemanja DraganiÄ, Raphael Steiner
Topological Drawings meet Classical Theorems from Convex Geometry
Helena Bergold, Stefan Felsner, Manfred Scheucher +2
Shortest paths on polymatroids and hypergraphic polytopes
Jean Cardinal, Raphael Steiner
A constant-factor step towards Vizing's conjecture
Raphael Steiner
Coloring hypergraphs with excluded minors
Raphael Steiner
On the choosability of $H$-minor-free graphs
Olivier Fischer, Raphael Steiner
Optimal bounds for zero-sum cycles. I. Odd order
Rutger Campbell, J. Pascal Gollin, Kevin Hendrey +1
Disjoint cycles with length constraints in digraphs of large connectivity or minimum degree
Raphael Steiner
Oriented cycles in digraphs of large outdegree
Lior Gishboliner, Raphael Steiner, Tibor Szabó
Edge Partitions of Complete Geometric Graphs (Part 2)
Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber +5
Twin-width of sparse random graphs
Kevin Hendrey, Sergey Norin, Raphael Steiner +1
Finding dense minors using average degree
Kevin Hendrey, Sergey Norin, Raphael Steiner +1
Short circuit walks in fixed dimension
Alexander E. Black, Christian Nöbel, Raphael Steiner
Improved bound for improper colorings of graphs with no odd clique minor
Raphael Steiner
Colouring Non-Even Digraphs
Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht
Subdigraphs of prescribed size and outdegree
Raphael Steiner
The Dominating 4-Colour Theorem
António Girão, Freddie Illingworth, Bojan Mohar +6
Vertex-critical graphs far from edge-criticality
Anders Martinsson, Raphael Steiner
Multicolor Ramsey numbers of odd cycles are superexponential
Raphael Steiner
Extending Thomassen's conjecture to directed graphs
Micha Christoph, Barnabás Janzer, Kalina Petrova +1
Asymptotic Equivalence of Hadwiger's Conjecture and its Odd Minor-Variant
Raphael Steiner
Defective coloring of blowups
Sergey Norin, Raphael Steiner
Nowhere-zero flow reconfiguration
Louis Esperet, Kevin Hendrey, Aurélie Lagoutte +3
Majority Colorings of Sparse Digraphs
Michael Anastos, Ander Lamaison, Raphael Steiner +1
Exact Matching in Graphs of Bounded Independence Number
Nicolas El Maalouly, Raphael Steiner
Exact Matching: Correct Parity and FPT Parameterized by Independence Number
Nicolas {El Maalouly}, Raphael Steiner, Lasse Wulf
Subdivisions with congruence constraints in digraphs of large chromatic number
Raphael Steiner
Pentagon contact representations
Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner
Small hitting sets for longest paths and cycles
Sergey Norin, Raphael Steiner, Stephan Thomassé +1
A note on digraph splitting
Micha Christoph, Kalina Petrova, Raphael Steiner
Fractional chromatic number vs. Hall ratio
Raphael Steiner
Towards the Lovász conjecture via sublinear expanders
Matija BuciÄ, Micha Christoph, Alexey Pokrovskiy +1
Heroes in orientations of chordal graphs
Pierre Aboulker, Guillaume Aubian, Raphael Steiner
Inapproximability of shortest paths on perfect matching polytopes
Jean Cardinal, Raphael Steiner
On an induced version of Menger's theorem
Kevin Hendrey, Sergey Norin, Raphael Steiner +1
Finding Short Paths on Simple Polytopes
Alexander E. Black, Raphael Steiner
On coloring digraphs with forbidden induced subgraphs
Raphael Steiner
Local Shearer bound
Anders Martinsson, Raphael Steiner
Openly disjoint cycles and directed tree-width of regular digraphs
Raphael Steiner
A Note on Graphs of Dichromatic Number 2
Raphael Steiner
Proof of the KAMAK tree conjecture
Micha Christoph, Raphael Steiner
Longest cycles in vertex-transitive and highly connected graphs
Carla Groenland, Sean Longbrake, Raphael Steiner +2
On Connectivity in Random Graph Models with Limited Dependencies
Johannes Lengler, Anders Martinsson, Kalina Petrova +4
Disproof of a Conjecture by Woodall
Raphael Steiner
Critical edge sets in vertex-critical graphs
Ema Skottova, Raphael Steiner
Hadwiger's conjecture and topological bounds
Raphael Steiner
The Star Dichromatic Number
Winfried Hochstättler, Raphael Steiner
Geometric realizations of dichotomous ordinal graphs
Patrizio Angelini, Sabine Cornelsen, Carolina Haase +5
A Note on Coloring Digraphs of Large Girth
Raphael Steiner
Hat guessing numbers of strongly degenerate graphs
Charlotte Knierim, Anders Martinsson, Raphael Steiner
Dichromatic number and forced subdivisions
Lior Gishboliner, Raphael Steiner, Tibor Szabó
Complexity of polytope diameters via perfect matchings
Christian Nöbel, Raphael Steiner
Cycle lengths modulo $k$ in expanders
Anders Martinsson, Raphael Steiner
Coloring circle arrangements: New $4$-chromatic planar graphs
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher +3
Matching Theory and Barnette's Conjecture
Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht
A Note On Universal Point Sets for Planar Graphs
Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner
The ErdÅs-Hajnal conjecture for odd-girth
Raphael Steiner
Disproof of the tree product conjecture via the Heisenberg group
Freddie Illingworth, Sergey Norin, Raphael Steiner
Size-Ramsey numbers of structurally sparse graphs
Nemanja DraganiÄ, Marc Kaufmann, David Munhá Correia +2
Improved bounds for zero-sum cycles in $\mathbb{Z}_p^d$
Micha Christoph, Charlotte Knierim, Anders Martinsson +1
Strengthening Hadwiger's conjecture for $4$- and $5$-chromatic graphs
Anders Martinsson, Raphael Steiner
On the Average Complexity of the $k$-Level
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher +3
Linear Size Universal Point Sets for Classes of Planar Graphs
Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder +1
On the Complexity of Digraph Colourings and Vertex Arboricity
Winfried Hochstättler, Felix Schröder, Raphael Steiner
On the difference between the chromatic and cochromatic number
Raphael Steiner
Resolution of the Kohayakawa-Kreuter conjecture
Micha Christoph, Anders Martinsson, Raphael Steiner +1
Topological Minors in Typical Lifts
Matija BuciÄ, Micha Christoph, Alp Müyesser +1
A logarithmic bound for simultaneous embeddings of planar graphs
Raphael Steiner
Flip distances between graph orientations
Oswin Aichholzer, Jean Cardinal, Tony Huynh +4
Coloring small locally sparse degenerate graphs and related problems
Domagoj BradaÄ, Jacob Fox, Raphael Steiner +2
Disproof of the Odd Hadwiger Conjecture
Marcus Kühn, Lisa Sauermann, Raphael Steiner +1
Chromatic number is not tournament-local
António Girão, Kevin Hendrey, Freddie Illingworth +4
A note on Ramsey numbers for minors
Maria Axenovich, Raphael Steiner
Zero sum cycles in complete digraphs
Tamás Mészáros, Raphael Steiner