23 citations · 150 across the 51 of their papers we have counts for
Showing 2026Show all
2 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 and a root , can the arborescences of rooted in be listed such that any two consecutive arboresce…
math.CO2026
Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio
Marthe Bonamy, Zdeněk Dvořák, Lukas Michel +1
We give an exact characterization of monotone graph classes C with bounded average degree that satisfy the following property: The domination number of every graph from C is bounde…