Skip to main content
Conference ProceedingsOPEN ACCESS

Separating thickness from geometric thickness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2528 LNCS 150-162
DOI: 10.1007/3-540-36151-0_15
15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Eppstein, D. (2002). Separating thickness from geometric thickness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 150–162). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free