On fan-crossing graphs

DOI10.1016/j.tcs.2020.07.002zbMath1461.68145arXiv1712.06840OpenAlexW3043294381MaRDI QIDQ2202017

Franz-Josef Brandenburg

Publication date: 17 September 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

graph drawingfansindependent edgesedge crossings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (9)

The density of fan-planar graphs ⋮ Simplifying Non-Simple Fan-Planar Drawings ⋮ Simplifying non-simple fan-planar drawings ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Straight-line drawings of 1-planar graphs ⋮ The family of fan-planar graphs ⋮ Unnamed Item ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Characterizing 5-map graphs by 2-fan-crossing graphs

Cites Work

• Unnamed Item
• On the maximum number of edges in quasi-planar graphs
• Quasi-planar graphs have a linear number of edges
• On fan-crossing and fan-crossing free graphs
• Recognizing optimal 1-planar graphs in linear time
• On grids in topological graphs
• Fan-planarity: properties and complexity
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• Topological graphs with no large grids
• On the Number of Edges of Fan-Crossing Free Graphs
• A First Order Logic Definition of Beyond-Planar Graphs
• On the Density of Maximal 1-Planar Graphs

This page was built for publication: On fan-crossing graphs