Geometric thickness in a grid

DOI10.1016/S0012-365X(03)00240-1zbMath1029.05108OpenAlexW2157363043MaRDI QIDQ1417581

David R. Wood

Publication date: 5 January 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00240-1

zbMATH Keywords

Graph drawingLas Vegas algorithmBook embeddingGeometric thickness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Relating Graph Thickness to Planar Layers and Bend Complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexities of layouts in three-dimensional VLSI circuits
• Multilayer grid embeddings for VLSI
• On the thickness and arboricity of a graph
• The book thickness of a graph
• On the thickness of graphs of given degree
• The thickness of graphs: A survey
• Biplanar graphs: A survey
• On representations of some thickness-two graphs
• Décomposition de \(K_16\) en trois graphes planaires
• Thickness and coarseness of graphs
• A decomposition theorem for partially ordered sets
• A Remark on Stirling's Formula
• Laying Out Graphs Using Queues
• Graphs with E Edges Have Pagenumber O(√E)
• Genus g Graphs Have Pagenumber O(√g)
• Geometric Thickness of Complete Graphs
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Degree constrained book embeddings
• On Crossing Sets, Disjoint Sets, and Pagenumber
• The Thickness of the Complete Graph

This page was built for publication: Geometric thickness in a grid