The thickness of fan-planar graphs is at most three

DOI10.1007/978-3-031-22203-0_18arXiv2208.12324OpenAlexW4317393704MaRDI QIDQ6172200

Maximilian Pfister, Otfried Schwarzkopf, Lena Schlipf

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

thicknessbeyond planarityFan-planarity

Mathematics Subject Classification ID

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

Related Items (3)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangle-free intersection graphs of line segments with large chromatic number
• The thickness of graphs: A survey
• The density of fan-planar graphs
• Simplifying non-simple fan-planar drawings
• On topological graphs with at most four crossings per edge
• Thickness and coarseness of graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Determining the thickness of graphs is NP-hard
• THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH
• On Optimal 2- and 3-Planar Graphs
• Beyond Planar Graphs: Introduction
• Fan-Planar Graphs
• Edge partitions of optimal 2-plane and 3-plane graphs
• The thickness of fan-planar graphs is at most three

This page was built for publication: The thickness of fan-planar graphs is at most three