3 citations · 3 across the 3 of their papers we have counts for
4 papers
Gallai's path decomposition in planar graphs
Alexandre Blanché, Marthe Bonamy, Nicolas Bonichon
In 1968, Gallai conjectured that the edges of any connected graph with vertices can be partitioned into paths. We show that this conjecture is true…
Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
Alexandre Blanché, Haruka Mizuta, Paul Ouvrard +1
Given a dominating set, how much smaller a dominating set can we find through elementary operations? Here, we proceed by iterative vertex addition and removal while maintaining the…
Clique-Width for Graph Classes Closed under Complementation
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson +3
Clique-width is an important graph parameter due to its algorithmic and structural properties. A graph class is hereditary if it can be characterized by a (not necessarily finite)…
Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson +1
A graph is -free for a pair of graphs if it contains no induced subgraph isomorphic to or . In 2001, Král', Kratochv\'ıl, Tuza, and Woeginger initia…