Separating thickness from geometric thickness

DOI10.1007/3-540-36151-0_15MaRDI QIDQ4422271zbMATH OpenFDO

Authors David Eppstein

Publication date 3 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0204252, http://link.springer.de/link/service/series/0558/bibs/2528/25280150.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(7)

• Geometric thickness in a grid
• Geodesic Attributes Thinnings and Thickenings
• Drawing Cubic Graphs with the Four Basic Slopes
• Straight-line drawings of 1-planar graphs
• Characterisations and examples of graph classes with bounded expansion
• Visualizing treewidth
• Characterization of unlabeled level planar trees

This page was built for publication: Separating thickness from geometric thickness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422271)