Amadeus Reinald

activity

20212026

most citedProving a directed analogue of the Gyárfás-Sumner conjecture for orientations of

P_{4}

1 citations · 1 across the 10 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

math.CO2025

Plane Strong Connectivity Augmentation

Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald +1

We investigate the problem of strong connectivity augmentation within plane oriented graphs. We show that deciding whether a plane oriented graph $D$ can be augmented with (any num…

math.CO2025

Making an oriented graph acyclic using inversions of bounded or prescribed size

Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch +3

Given an oriented graph $D$ , the inversion of a subset $X$ of vertices consists in reversing the orientation of all arcs with both endpoints in $X$ . When the subset $X$ is of size…

cs.DM2025

Twin-width one

Jungho Ahn, Hugo Jacob, Noleen Köhler +3

We investigate the structure of graphs of twin-width at most $1$ , and obtain the following results: - Graphs of twin-width at most $1$ are permutation graphs. In particular they ha…