17 citations · 42 across the 15 of their papers we have counts for
3 papers · 1 filter
On the Enumeration of Minimal Dominating Sets and Related Notions
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary +1
A dominating set in a graph is a subset of its vertex set such that each vertex is either in or has a neighbour in . In this paper, we are interested in the enumeration…
A Note on Graphs of Linear Rank-Width 1
Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy
We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is tha…
The Rank-Width of Edge-Colored Graphs
Mamadou Moustapha Kante, Michael Rao
Clique-width is a complexity measure of directed as well as undirected graphs. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and str…