A note on 1-planar graphs
From MaRDI portal
Publication:401145
DOI10.1016/j.dam.2014.05.025zbMath1298.05081OpenAlexW2149888405WikidataQ59702329 ScholiaQ59702329MaRDI QIDQ401145
Publication date: 26 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.025
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
On RAC drawings of 1-planar graphs, An annotated bibliography on 1-planarity, Straight-line drawings of 1-planar graphs, On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs, Maximal 1-plane graphs with dominating vertices, New results on edge partitions of 1-plane graphs, An annotated review on graph drawing and its applications, A new note on 1-planar graphs with minimum degree 7, The QuaSEFE problem, On partitioning the edges of 1-plane graphs, Improved approximation algorithms for box contact representations, Edge partitions of optimal 2-plane and 3-plane graphs, Ortho-polygon visibility representations of embedded graphs, Quantitative Restrictions on Crossing Patterns, Edge Partitions and Visibility Representations of 1-planar Graphs, $$\textit{\textbf{k}}$$-Planar Graphs
Cites Work
- On drawings and decompositions of 1-planar graphs
- 1-planarity of complete multipartite graphs
- Drawing graphs with right angle crossings
- The structure of 1-planar graphs
- Graphs drawn with few crossings per edge
- Density of straight-line 1-planar graph drawings
- Right angle crossing graphs and 1-planarity
- Ein Sechsfarbenproblem auf der Kugel
- Parameterized Complexity of 1-Planarity
- The Crossing-Angle Resolution in Graph Drawing
- Fáry’s Theorem for 1-Planar Graphs
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Zur Struktur 1‐planarer Graphen
- A new proof of the 6 color theorem
- On the Density of Maximal 1-Planar Graphs
- Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time
- Adding one edge to planar graphs makes crossing number hard
- Notes on large angle crossing graphs
- Acyclic colouring of 1-planar graphs
