• Corpus ID: 17995038

Separating Geometric Thickness from Book Thickness

  title={Separating Geometric Thickness from Book Thickness},
  author={David Eppstein},
We show that geometric thickness and book thickness are not asymptotically equivalent: for every t, there exists a graph with geometric thickness two and book thickness >= t. 

Figures from this paper

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.
The geometric thickness of low degree graphs
It is proved that the geometric thickness of graphs whose maximum degree is no more than four is two, and an embedding algorithm for graphs with maximum degree three that uses an n x n grid and a more complex algorithm for embedding a graph withmaximum degree four.
Graph Treewidth and Geometric Thickness Parameters
It is shown that the lower bound for thickness can be matched by an upper bound, even in the more restrictive geometric setting, and that for graphs of treewidth k, the maximum thickness and the maximum geometric thickness both equal ⌈k/2⌉.
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
This work proves that there exists Delta-regular graphs with arbitrarily large geometric thickness, and proves that for all Delta >= 9 and for all large n, there exists a Delta- regular graph with geometric thickness at least c Delta^{1/2} n^{1 /2 - 4/Delta - epsilon}.
A pr 2 00 6 Graph Treewidth and Geometric Thickness Parameters ∗
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph parameter
Cubic planar bipartite graphs are dispersable
A graph is called dispersable if it has a book embedding in which each page has maximum degree 1 and the number of pages is the maximum degree. Bernhart and Kainen conjectured every k-regular
Three-dimensional graph products with unbounded stack-number
We prove that the stack-number of the strong product of three n-vertex paths is Θ(n). The best previously known upper bound wasO(n). No non-trivial lower bound was known. This is the first explicit
Proximity Drawings of High-Degree Trees
This paper shows that if a partition or covering of the tree by subtrees of bounded degree satisfies some natural properties, then there is a drawing of the entire tree such that each of the given subtrees is drawn as a minimum spanning tree of its vertex set.
Thickness and Antithickness of Graphs
Questions about duality between crossings and non-crossings in graph drawings via the notions of thickness and antithickness are studied, with an emphasis on extremal questions.


The book thickness of a graph
The Thickness of Graphs: A Survey
A state-of-the-art survey of the thickness of a graph from both a theoretical and a practical point of view is given and some modifications of a basic heuristic are investigated for evaluating the thickness and determining a decomposition of agraph in planar subgraphs.
Ramsey Theory
a temporary collection of stars, we earthlings observe from the edge of an ordinary galaxy. Yet most stargazers agree that the night sky appears to be filled with constellations in the shape of
Thickness and coarseness of graphs
Geometric Thickness in a Grid of Linear Area
  • David R. Wood
  • Mathematics, Computer Science
    Electron. Notes Discret. Math.
  • 2001
Graph Drawing: Algorithms for the Visualization of Graphs
  • Prentice Hall
  • 1999