On Layered Fan-Planar Graph Drawings

DOI10.4230/LIPICS.MFCS.2020.14MaRDI QIDQ5089175zbMATH OpenOpenAlexFDO

Authors

Publication date 18 July 2022

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

zbMATH Keywords

parameterized complexitygraph drawingbeyond planar graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
• An annotated bibliography on 1-planarity
• Crossing numbers of graphs
• Height-preserving transformations of planar graph drawings
• Laying Out Graphs Using Queues
• On the parameterized complexity of layered graph drawing
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions

Cited in

(5)

• Simplifying Non-Simple Fan-Planar Drawings
• 2-Layer k-Planar Graphs
• Optimal-area visibility representations of outer-1-plane graphs
• The family of fan-planar graphs
• Graph Drawing

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

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