The maximal 1-planarity and crossing numbers of graphs

DOI10.1007/s00373-021-02320-xzbMath1471.05028OpenAlexW3152808630WikidataQ112879334 ScholiaQ112879334MaRDI QIDQ2042209

Zhang Dong Ouyang, Fengming Dong, Yuan Qiu Huang

Publication date: 28 July 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02320-x

zbMATH Keywords

drawingcrossing numberplanar graph1-planar graph

Mathematics Subject Classification ID

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

Related Items (1)

On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs

Cites Work

• Unnamed Item
• A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
• On drawings and decompositions of 1-planar graphs
• The structure of 1-planar graphs
• Graphs drawn with few crossings per edge
• The structure of plane graphs with independent crossings and its applications to coloring problems
• Density of straight-line 1-planar graph drawings
• A note on 1-planar graphs with minimum degree 7
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• \(\mathsf{NIC}\)-planar graphs
• Chromatic number, independence ratio, and crossing number
• Zur Struktur 1‐planarer Graphen
• Improvements on the density of maximal 1‐planar graphs
• On the Density of Maximal 1-Planar Graphs
• 1-Planar Graphs

This page was built for publication: The maximal 1-planarity and crossing numbers of graphs