A note on 1-planar graphs

DOI10.1016/J.DAM.2014.05.025zbMATH Open1298.05081OpenAlexW2149888405WikidataQ59702329 ScholiaQ59702329MaRDI QIDQ401145FDOQ401145

Eyal Ackerman

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

Recommendations

• On drawings and decompositions of 1-planar graphs
• Density of straight-line 1-planar graph drawings
• Improvements on the density of maximal 1-planar graphs
• On the density of maximal 1-planar graphs
• The structure of 1-planar graphs

zbMATH Keywords

right angle crossings1-planar graphs

Mathematics Subject Classification ID

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

Cites Work

• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• A new proof of the 6 color theorem
• Graphs drawn with few crossings per edge
• Ein Sechsfarbenproblem auf der Kugel
• The structure of 1-planar graphs
• Density of straight-line 1-planar graph drawings
• Right angle crossing graphs and 1-planarity
• Parameterized Complexity of 1-Planarity
• Fáry’s Theorem for 1-Planar Graphs
• On the Density of Maximal 1-Planar Graphs
• The Crossing-Angle Resolution in Graph Drawing
• Drawing graphs with right angle crossings
• Acyclic colouring of 1-planar graphs
• Zur Struktur 1‐planarer Graphen
• Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time
• On drawings and decompositions of 1-planar graphs
• 1-planarity of complete multipartite graphs
• Adding one edge to planar graphs makes crossing number hard
• Notes on large angle crossing graphs

Cited In (23)

• Title not available (Why is that?)
• 1-Planar Graphs
• An annotated review on graph drawing and its applications
• Edge partitions of optimal 2-plane and 3-plane graphs
• Ortho-polygon visibility representations of embedded graphs
• Straight-line drawings of 1-planar graphs
• $$\textit{\textbf{k}}$$-Planar Graphs
• Edge Partitions and Visibility Representations of 1-planar Graphs
• Quantitative Restrictions on Crossing Patterns
• The book thickness of 1-planar graphs is constant
• Algorithms for 1-Planar Graphs
• A new note on 1-planar graphs with minimum degree 7
• A note on 1-planar graphs with minimum degree 7
• On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
• On RAC drawings of 1-planar graphs
• An annotated bibliography on 1-planarity
• Maximal 1-plane graphs with dominating vertices
• The maximal 1-planarity and crossing numbers of graphs
• On partitioning the edges of 1-plane graphs
• New results on edge partitions of 1-plane graphs
• A note on \(l_ 1\)-rigid planar graphs
• Improved approximation algorithms for box contact representations
• The QuaSEFE problem

This page was built for publication: A note on 1-planar graphs

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