Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)
Separating Thickness from Geometric Thickness
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.
- 2.L. W. Beineke. The decomposition of complete graphs into planar subgraphs. Graph Theory and Theoretical Physics, chapter 4, pp. 139–153. Academic Press, 1967.Google Scholar
- 6.D. Eppstein. Separating geometric thickness from book thickness. arXiv.org, September 2001, http://arXiv:math.CO/0109195.
- 7.I. Fáry. On straight line representation of planar graphs. Acta Sci. Math. Szeged. 11:229–233, 1948.Google Scholar
- 8.R. L. Graham, B. L. Rothschild, and J. H. Spencer. Ramsey Theory. Wiley, 1980.Google Scholar
- 10.B. Jackson and G. Ringel. Plane constructions for graphs, networks, and maps: Measurements of planarity. Selected Topics in Operations Research and Mathematical Economics: Proc. 8th Symp. Operations Research, pp. 315–324. Springer-Verlag, Lecture Notes in Economics and Mathematical Systems 226, August 1983.Google Scholar
- 14.J. Vasak. The thickness of the complete graph having 6m+4p oints. Manuscript, cited in  and .Google Scholar
- 15.D. R. Wood. Geometric thickness in a grid of linear area. Proc. Euroconf. Combinatorics, Graph Theory, and Applications, pp. 310–315. Univ. Autònoma de Barcelona, Centre de Recerca Matemàtica, September 2001, http://www.cs.usyd.edu.au/~davidw/papers/Wood-COMB01.ps.
© Springer-Verlag Berlin Heidelberg 2002