activity
20062013
most citedPlanar Decompositions and the Crossing Number of Graphs with an Excluded Minor

1 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing 2009Show all

1 paper · 1 filter

math.CO2009★ 1 cited

On the boolean-width of a graph: structure and applications

Y. Rabinovich, J. A. Telle

We study the recently introduced boolean-width of graphs. Our structural results are as follows. Firstly, we show that almost surely the boolean-width of a random graph on vert…