1 citations · 2 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 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…
math.CO2006★ 1 cited
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
David R. Wood, Jan Arne Telle
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar…