Embedding planar graphs in four pages
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The star-arboricity of the complete regular multipartite graphs
Discrete Mathematics
On the thickness of graphs of given degree
Information Sciences: an International Journal
The pagenumber of k-trees is O(k)
Discrete Applied Mathematics
Stack and Queue Number of 2-Trees
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Graph Treewidth and Geometric Thickness Parameters
Discrete & Computational Geometry
Partitions of complete geometric graphs into plane trees
Computational Geometry: Theory and Applications
Graph drawings with few slopes
Computational Geometry: Theory and Applications
Drawings of planar graphs with few slopes and segments
Computational Geometry: Theory and Applications
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Cubic Graphs Have Bounded Slope Parameter
Graph Drawing
Hi-index | 0.01 |
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 thicknessθ(G). By restricting the edges to be straight, we obtain the geometric thickness${\bar\theta}$(G). By further restricting the vertices to be in convex position, we obtain the book thicknessbt(G). This paper studies the relationship between these parameters and the treewidth of G. Let $\theta({\mathcal T}_{k}) / {\bar\theta}({\mathcal T}_{k}) / {\tt bt}({\mathcal T}_{k})$denote the maximum thickness / geometric thickness / book thickness of a graph with treewidth at most k. We prove that: – $\theta({\mathcal T}_{k})={\bar\theta}({\mathcal T}_{k}) = \lceil k/2 \rceil$, and – ${\tt bt}({\mathcal T}_{k}) = k$for k≤2, and ${\tt bt}({\mathcal T}_{k}) = k+1$for k≥3. The first result says that the lower bound for thickness can be matched by an upper bound, even in the more restrictive geometric setting. The second result disproves the conjecture of Ganley and Heath [Discrete Appl. Math. 2001] that ${\tt bt}({\mathcal T}_{k}) = k$for all k. Analogous results are proved for outerthickness, arboricity, and star-arboricity.