Simplifying non-simple fan-planar drawings

DOI10.1007/978-3-030-92931-2_4OpenAlexW4206816728MaRDI QIDQ2151431

Felix Schröder, Boris Klemz, Kristin Knorr, Meghana M. Reddy

Publication date: 1 July 2022

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

zbMATH Keywords

graph drawingsimple topological graphsbeyond-planar graphsfan-planar graphs

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)

The density of fan-planar graphs ⋮ Simplifying Non-Simple Fan-Planar Drawings ⋮ The family of fan-planar graphs ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ The thickness of fan-planar graphs is at most three

Cites Work

• Drawing graphs with right angle crossings
• On the maximum number of edges in quasi-planar graphs
• Graphs drawn with few crossings per edge
• Quasi-planar graphs have a linear number of edges
• 1-fan-bundle-planar drawings of graphs
• Gap-planar graphs
• On fan-crossing graphs
• Fan-planarity: properties and complexity
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• On the Number of Edges of Fan-Crossing Free Graphs
• Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
• On Optimal 2- and 3-Planar Graphs
• Beyond Planar Graphs: Introduction
• Fan-Planar Graphs

This page was built for publication: Simplifying non-simple fan-planar drawings