J. A. Telle

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

3 papers

cs.DS2013

Connecting Terminals and 2-Disjoint Connected Subgraphs

Jan Arne Telle, Yngve Villanger

Given a graph $G = (V, E)$ and a set of terminal vertices $T$ we say that a superset $S$ of $T$ is $T$ -connecting if $S$ induces a connected graph, and $S$ is minimal if no strict sub…

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 $n$ 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…