A note on 1-planar graphs

DOI10.1016/J.DAM.2014.05.025MaRDI QIDQ401145zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

1-planar graphsright angle crossings

Mathematics Subject Classification ID

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

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

Cites work

• 1-planarity of complete multipartite graphs
• A new proof of the 6 color theorem
• Acyclic colouring of 1-planar graphs
• Adding one edge to planar graphs makes crossing number hard
• Density of straight-line 1-planar graph drawings
• Drawing graphs with right angle crossings
• Ein Sechsfarbenproblem auf der Kugel
• Fáry's theorem for 1-planar graphs
• Graphs drawn with few crossings per edge
• Notes on large angle crossing graphs
• On drawings and decompositions of 1-planar graphs
• On the density of maximal 1-planar graphs
• Parameterized complexity of 1-planarity
• Right angle crossing graphs and 1-planarity
• Testing maximal 1-planarity of graphs with a rotation system in linear time (extended abstract)
• The crossing-angle resolution in graph drawing
• The structure of 1-planar graphs
• Zur Struktur 1‐planarer Graphen

Cited in

(25)

• New results on edge partitions of 1-plane graphs
• A note on \(l_ 1\)-rigid planar graphs
• Density of straight-line 1-planar graph drawings
• The maximal 1-planarity and crossing numbers of graphs
• The QuaSEFE problem
• A note on 1-planar graphs with minimum degree 7
• An annotated bibliography on 1-planarity
• scientific article; zbMATH DE number 6381690 (Why is no real title available?)
• On drawings and decompositions of 1-planar graphs
• Improvements on the density of maximal 1-planar graphs
• Quantitative restrictions on crossing patterns
• 1-Planar Graphs
• Algorithms for 1-Planar Graphs
• Edge Partitions and Visibility Representations of 1-planar Graphs
• \(k\)-planar graphs
• Drawing graph joins in the plane with restrictions on crossings
• 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
• 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
• An annotated review on graph drawing and its applications
• A new note on 1-planar graphs with minimum degree 7
• On generalizations of pairwise compatibility graphs

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)