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

DOI10.1016/J.DAM.2019.04.012MaRDI QIDQ2274073zbMATH OpenOpenAlexFDO

Authors Franz J. 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

beyond planar graphsedge crossingsgraph drawingplanar graphs

Mathematics Subject Classification ID

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

Recommendations

• On fan-crossing graphs
• On fan-crossing and fan-crossing free graphs
• Fan-crossing free graphs and their relationship to other beyond-planar graphs

Cites work

• 1-planarity of graphs with a rotation system
• \(\mathsf{NIC}\)-planar graphs
• A first order logic definition of beyond-planar graphs
• Algorithms for graphs embeddable with few crossings per edge
• An annotated bibliography on 1-planarity
• Approximation algorithms for independent sets in map graphs
• Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
• Characterizing and recognizing 4-map graphs
• Ein Sechsfarbenproblem auf der Kugel
• Fan-planarity: properties and complexity
• Graphs drawn with few crossings per edge
• scientific article; zbMATH DE number 434700 (Why is no real title available?)
• scientific article; zbMATH DE number 1775439 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Map graphs
• On fan-crossing graphs
• On the density of maximal 1-planar graphs
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• Recognizing hole-free 4-map graphs in cubic time
• Straight-line grid drawings of 3-connected 1-planar graphs
• Topological graphs with no large grids
• Zur Struktur 1‐planarer Graphen
• Über 1-optimale Graphen

Cited in

(4)

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

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

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