Relating graph thickness to planar layers and bend complexity

DOI10.4230/LIPICS.ICALP.2016.10MaRDI QIDQ4598142zbMATH OpenOpenAlexFDO

Authors 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

bendsgeometric thicknessgraph drawinglayersthickness

Mathematics Subject Classification ID

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

Recommendations

• Relating graph thickness to planar layers and bend complexity
• Geometric thickness in a grid
• Geometric Thickness of Complete Graphs
• Thickness and colorability of geometric graphs
• On graph thickness, geometric thickness, and separator theorems

Cited in

(5)

• Drawing plane triangulations with few segments
• Polyline drawings with topological constraints
• Relating graph thickness to planar layers and bend complexity
• Polyline Drawings with Topological Constraints
• Edge partitions of optimal 2-plane and 3-plane graphs

This page was built for publication: Relating graph thickness to planar layers and bend complexity

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