On Layered Fan-Planar Graph Drawings

DOI10.4230/LIPIcs.MFCS.2020.14OpenAlexW3082557442MaRDI QIDQ5089175

No author found.

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2002.09597

zbMATH Keywords

graph drawingparameterized complexitybeyond planar graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Optimal-area visibility representations of outer-1-plane graphs ⋮ The family of fan-planar graphs ⋮ 2-Layer k-Planar Graphs

Cites Work

• On the parameterized complexity of layered graph drawing
• An annotated bibliography on 1-planarity
• Height-Preserving Transformations of Planar Graph Drawings
• Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
• Laying Out Graphs Using Queues
• Crossing Numbers of Graphs
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions

This page was built for publication: On Layered Fan-Planar Graph Drawings