Geometric Thickness in a Grid of Linear Area
From MaRDI portal
Publication:3438999
DOI10.1016/S1571-0653(04)00413-5zbMath1184.05035OpenAlexW2018893712MaRDI QIDQ3438999
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00413-5
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)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Thickness and coarseness of graphs
- A decomposition theorem for partially ordered sets
- Graphs with E Edges Have Pagenumber O(√E)
- Genus g Graphs Have Pagenumber O(√g)
- Geometric Thickness of Complete Graphs
This page was built for publication: Geometric Thickness in a Grid of Linear Area