23 citations · 150 across the 51 of their papers we have counts for
69 papers
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…
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…
Infinite induced-saturated graphs
Marthe Bonamy, Carla Groenland, Tom Johnston +2
A graph is -induced-saturated if is -free but deleting any edge or adding any edge creates an induced copy of . There are non-trivial graphs , such as , fo…
On graph classes with constant domination-packing ratio
Marthe Bonamy, Mónika Csikós, Anna Gujgiczer +1
The dominating number of a graph is the minimum size of a vertex set whose closed neighborhood covers all the vertices of the graph. The packing number of is…
Partitioning edges of a planar graph into linear forests and a matching
Marthe Bonamy, Jadwiga Czyżewska, Łukasz Kowalik +1
We show that the edges of any planar graph of maximum degree at most can be partitioned into linear forests and a matching. Combined with known results, this implies that t…
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
Marthe Bonamy, Édouard Bonnet, Hugues Déprés +5
A graph is -free if it does not contain pairwise vertex-disjoint and non-adjacent cycles. We prove that "sparse" (here, not containing large complete bipartite g…