Testing bipartiteness of geometric intersection graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The geometric thickness of low degree graphs
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Characterization of unlabeled level planar trees
Computational Geometry: Theory and Applications
Thickness of bar 1-visibility graphs
GD'06 Proceedings of the 14th international conference on Graph drawing
Characterisations and examples of graph classes with bounded expansion
European Journal of Combinatorics
Drawing cubic graphs with the four basic slopes
GD'11 Proceedings of the 19th international conference on Graph Drawing
Mad at edge crossings? break the edges!
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 0.00 |
We show that graph-theoretic thickness and geometric thickness are not asymptotically equivalent: for every t, there exists a graph with thickness three and geometric thickness 驴 t.