Relating Graph Thickness to Planar Layers and Bend Complexity.

DOI10.4230/LIPIcs.ICALP.2016.10zbMath1388.68225OpenAlexW2910693789MaRDI QIDQ4598142

Stephane Durocher, Debajyoti Mondal

Publication date: 19 December 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.10

zbMATH Keywords

thicknessgraph drawinglayersbendsgeometric thickness

Mathematics Subject Classification ID

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

Related Items (5)

Drawing plane triangulations with few segments ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ Edge partitions of optimal 2-plane and 3-plane graphs ⋮ Polyline drawings with topological constraints ⋮ Polyline Drawings with Topological Constraints

This page was built for publication: Relating Graph Thickness to Planar Layers and Bend Complexity.