17 citations · 42 across the 15 of their papers we have counts for
1 paper · 1 filter
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…