Characterizing 5-map graphs by 2-fan-crossing graphs

DOI10.1016/j.dam.2019.04.012zbMath1419.05142OpenAlexW2944801675MaRDI QIDQ2274073

Franz-Josef Brandenburg

Publication date: 19 September 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.04.012

zbMATH Keywords

planar graphsgraph drawingedge crossingsbeyond planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ Recognizing map graphs of bounded treewidth ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizing and drawing IC-planar graphs
• Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
• Graphs drawn with few crossings per edge
• Characterizing and recognizing 4-map graphs
• On fan-crossing 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
• \(\mathsf{NIC}\)-planar graphs
• Algorithms for graphs embeddable with few crossings per edge
• Recognizing hole-free 4-map graphs in cubic time
• Topological graphs with no large grids
• Approximation Algorithms for Independent Sets in Map Graphs
• Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
• Map graphs
• Über 1-optimale Graphen
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Zur Struktur 1‐planarer Graphen
• A First Order Logic Definition of Beyond-Planar Graphs
• On the Density of Maximal 1-Planar Graphs
• 1-Planarity of Graphs with a Rotation System

This page was built for publication: Characterizing 5-map graphs by 2-fan-crossing graphs