Simplifying Non-Simple Fan-Planar Drawings

DOI10.7155/JGAA.00618MaRDI QIDQ5886039zbMATH OpenOpenAlexFDO

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

Publication date 30 March 2023

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00618

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Simplifying non-simple fan-planar drawings
• On Layered Fan-Planar Graph Drawings
• Drawing planar graphs with few geometric primitives
• Drawing planar graphs with few geometric primitives
• Non-aligned drawings of planar graphs
• Non-aligned drawings of planar graphs
• scientific article; zbMATH DE number 1747605
• Graph Drawing

Cites work

• Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
• Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 -- December 1, 2016
• Computational geometry. Algorithms and applications.
• Drawing graphs with right angle crossings
• Fan-planar graphs
• Fan-planarity: properties and complexity
• Gap-planar graphs
• Graphs drawn with few crossings per edge
• On fan-crossing graphs
• On Optimal 2- and 3-Planar Graphs
• On the maximum number of edges in quasi-planar graphs
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• Quasi-planar graphs have a linear number of edges
• Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
• Simplifying non-simple fan-planar drawings

Cited in

(5)

• Simplifying non-simple fan-planar drawings
• Fan-planar graphs: combinatorial properties and complexity results
• Crossing numbers of beyond planar graphs re-revisited: a framework approach
• Note on min-k-planar drawings of graphs
• The density formula: one lemma to bound them all

This page was built for publication: Simplifying Non-Simple Fan-Planar Drawings

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