33 citations · 48 across the 15 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 1 cited
On a class of intersection graphs
Mourad Baïou, Laurent Beaudou, Zhentao Li +1
Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs…
cs.DM2013★ 2 cited
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…