Raphael Steiner

From MaRDI portal
Person:779241

Available identifiers

zbMath Open steiner.raphaelMaRDI QIDQ779241

List of research outcomes





PublicationDate of PublicationType
On connectivity in random graph models with limited dependencies2025-01-14Paper
Finding dense minors using average degree2024-11-24Paper
On an induced version of Menger's theorem2024-11-09Paper
On the choosability of \(H\)-minor-free graphs2024-11-05Paper
Colouring non-even digraphs2024-10-18Paper
Linear size universal point sets for classes of planar graphs2024-10-16Paper
A logarithmic bound for simultaneous embeddings of planar graphs2024-10-14Paper
Hadwiger's conjecture and topological bounds2024-09-30Paper
Coloring circle arrangements: new 4-chromatic planar graphs2024-09-30Paper
Coloring circle arrangements: new 4-chromatic planar graphs2024-09-13Paper
On connectivity in random graph models with limited dependencies2024-09-02Paper
Exact matching in graphs of bounded independence number2024-08-06Paper
Coloring hypergraphs with excluded minors2024-07-08Paper
Chromatic number is not tournament-local2024-07-01Paper
Edge partitions of complete geometric graphs2024-05-14Paper
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs2024-01-29Paper
Tight bounds for divisible subdivisions2024-01-15Paper
Twin-width of sparse random graphs2023-12-06Paper
Vertex-critical graphs far from edge-criticality2023-10-19Paper
Topological drawings meet classical theorems from convex geometry2023-10-12Paper
A note on digraph splitting2023-10-12Paper
On an induced version of Menger's theorem2023-09-14Paper
Clustered Colouring of Odd-$H$-Minor-Free Graphs2023-08-29Paper
Size-Ramsey numbers of structurally sparse graphs2023-07-22Paper
Finding dense minors using average degree2023-07-03Paper
Hat Guessing Numbers of Strongly Degenerate Graphs2023-06-27Paper
A logarithmic bound for simultaneous embeddings of planar graphs2023-05-30Paper
Chromatic number is not tournament-local2023-05-24Paper
On Connectivity in Random Graph Models with Limited Dependencies2023-05-04Paper
On the choosability of $H$-minor-free graphs2023-04-09Paper
Linear Size Universal Point Sets for Classes of Planar Graphs2023-02-28Paper
Matching theory and Barnette's conjecture2022-11-23Paper
Even circuits in oriented matroids2022-11-21Paper
Colouring non-even digraphs2022-11-08Paper
Colorings of oriented planar graphs avoiding a monochromatic subgraph2022-08-24Paper
Coloring hypergraphs with excluded minors2022-06-27Paper
Coloring circle arrangements: New $4$-chromatic planar graphs2022-05-17Paper
Exact Matching in Graphs of Bounded Independence Number2022-02-24Paper
Coloring drawings of graphs2022-02-01Paper
Disproof of a Conjecture by Woodall2022-01-22Paper
The star dichromatic number2022-01-03Paper
Edge Partitions of Complete Geometric Graphs (Part 2)2021-12-15Paper
Topological Drawings Meet Classical Theorems from Convex Geometry2021-12-01Paper
Flip distances between graph orientations2021-02-01Paper
Complete minors in digraphs with given dichromatic number2021-01-12Paper
On the average complexity of the $k$-level2020-11-12Paper
On the Complexity of Digraph Colourings and Vertex Arboricity2020-10-28Paper
A note on universal point sets for planar graphs2020-10-26Paper
A note on coloring digraphs of large girth2020-10-14Paper
A Note on Universal Point Sets for Planar Graphs2020-09-04Paper
Oriented cycles in digraphs of large outdegree2020-08-30Paper
Parameterized algorithms for directed modular width2020-07-21Paper
Complete acyclic colorings2020-06-04Paper
Flip distances between graph orientations2020-02-24Paper
Equiangular polygon contact representations2018-11-22Paper
Pentagon contact representations2018-09-07Paper
Pentagon contact representations2018-01-18Paper
Hadwiger's conjecture and topological boundsN/APaper
Resolution of the Kohayakawa-Kreuter conjectureN/APaper

Research outcomes over time

This page was built for person: Raphael Steiner