Separating Thickness from Geometric Thickness

2002/04/30 by David Eppstein · 1 citation
Mathematics · Computer Science · #math.CO #cs.CG #cs.DM #msc:05C10

paper · pdf

published as In "Towards a Theory of Geometric Graphs", J. Pach, ed., Contemporary Math. 342, pp. 75-86, 2004 · 12 pages, 8 figures. This revision incorporates suggestions of the referee and reformats to AMS CONM proceedings style

arxiv created 2003/07/25 · arxiv updated 2009/11/30

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.

Cited by

• Visualizing Treewidth

Related

• Separating Geometric Thickness from Book Thickness
• Geometric Thickness of Complete Graphs
• The thickness of cartesian product K_n \Box P_m
• Geometric Thickness of Multigraphs is ∃ ℝ-complete
• The Geometric Thickness of Low Degree Graphs