Michael Hoffmann

activity

20242026

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

A Gray code for arborescences of tournaments

Marthe Bonamy, Michael Hoffmann, Clément Legrand-Duchesne +1

We consider the following question of Knuth: given a directed graph $G$ and a root $r$ , can the arborescences of $G$ rooted in $r$ be listed such that any two consecutive arboresce…

math.CO2025

Crossing Number of 3-Plane Drawings

Miriam Goetze, Michael Hoffmann, Ignaz Rutter +1

We study 3-plane drawings, that is, drawings of graphs in which every edge has at most three crossings. We show how the recently developed Density Formula for topological drawings…

math.CO2024

On $k$ -planar Graphs without Short Cycles

Michael A. Bekos, Prosenjit Bose, Aaron Büngener +6

We study the impact of forbidding short cycles to the edge density of $k$ -planar graphs; a $k$ -planar graph is one that can be drawn in the plane with at most $k$ crossings per edg…

A Gray code for arborescences of tournaments

Crossing Number of 3-Plane Drawings

On k-planar Graphs without Short Cycles

On $k$ -planar Graphs without Short Cycles