On the Density of Non-simple 3-Planar Graphs
From MaRDI portal
Publication:2961527
DOI10.1007/978-3-319-50106-2_27zbMath1483.68249arXiv1602.04995OpenAlexW2513288550MaRDI QIDQ2961527
Michael A. Bekos, Chrysanthi N. Raftopoulou, Michael Kaufmann
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.04995
Graph theory (including graph drawing) in computer science (68R10) Density (toughness, etc.) (05C42)
Related Items
The density of fan-planar graphs, On the Density of Non-simple 3-Planar Graphs, Optimal 1-planar multigraphs, Gap-Planar Graphs, Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar, Unnamed Item, On RAC drawings of graphs with one bend per edge, Gap-planar graphs, On RAC drawings of graphs with one bend per edge, $$\textit{\textbf{k}}$$-Planar Graphs, 2-Layer k-Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Drawing graphs with right angle crossings
- How to draw a planar graph on a grid
- Improving the crossing lemma by finding more crossings in sparse graphs
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- Ein Sechsfarbenproblem auf der Kugel
- The book thickness of 1-planar graphs is constant
- Algorithms for graphs embeddable with few crossings per edge
- Testing Full Outer-2-planarity in Linear Time
- On the Number of Edges of Fan-Crossing Free Graphs
- 1-Visibility Representations of 1-Planar Graphs
- On the Density of Non-simple 3-Planar Graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- A new proof of the 6 color theorem
- On the Density of Maximal 1-Planar Graphs
- Notes on large angle crossing graphs
- How to Draw a Graph
- Drawing graphs. Methods and models
