Weakly and Strongly Fan-Planar Graphs

DOI10.1007/978-3-031-49272-3_4MaRDI QIDQ6447709zbMATH OpenOpenAlexFDO

Authors Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf

Publication date 17 August 2023

Full work available at URL https://doi.org/10.1007/978-3-031-49272-3_4

Mathematics Subject Classification ID

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

Cited in

(3)

• Crossing numbers of beyond planar graphs re-revisited: a framework approach
• The density formula: one lemma to bound them all
• A unified FPT framework for crossing number problems

This page was built for publication: Weakly and Strongly Fan-Planar Graphs

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