Geometric thickness in a grid
type: Item
instance of: scholarly article
title: Geometric thickness in a grid
zbMATH Open document ID: 1029.05108
DOI: 10.1016/S0012-365X(03)00240-1
author: David R. Wood
published in: Discrete Mathematics
publication date: 2004-01-05T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 2021233
zbMATH Keywords: Graph drawing
zbMATH Keywords: Geometric thickness
zbMATH Keywords: Book embedding
zbMATH Keywords: Las Vegas algorithm
MaRDI profile type: Publication
cites work: Complexities of layouts in three-dimensional VLSI circuits
cites work: Multilayer grid embeddings for VLSI
cites work: Q4111609
cites work: The Thickness of the Complete Graph
cites work: Q5607732
cites work: Biplanar graphs: A survey
cites work: The book thickness of a graph
cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
cites work: Q4873812
cites work: On the thickness and arboricity of a graph
cites work: Geometric Thickness of Complete Graphs
cites work: A decomposition theorem for partially ordered sets
cites work: Q4422271
cites work: Q5786239
cites work: On the thickness of graphs of given degree
cites work: Laying Out Graphs Using Queues
cites work: On representations of some thickness-two graphs
cites work: Thickness and coarseness of graphs
cites work: Q3997942
cites work: Genus g Graphs Have Pagenumber O(√g)
cites work: Graphs with E Edges Have Pagenumber O(√E)
cites work: Décomposition de \(K_16\) en trois graphes planaires
cites work: The thickness of graphs: A survey
cites work: A Remark on Stirling's Formula
cites work: On Crossing Sets, Disjoint Sets, and Pagenumber
cites work: Degree constrained book embeddings
full work available at URL: s0012-365x(03)00240-1
OpenAlex ID: W2157363043
description: scientific article; zbMATH DE number 2021233