Name
Abstract | ||
|---|---|---|
We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively. A drawing of a graph is 1-planar if every edge is crossed at most once. A 1-planar drawing is IC-planar if no two pairs of crossing edges share a vertex. A 1-planar drawing is NIC-planar if no two pairs of crossing edges share two vertices. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.comgeo.2019.07.006 | Computational Geometry |
Keywords | DocType | Volume |
Graph drawing,Beyond-planar graphs,1-planar graphs,Right-angle crossings,Grid drawing | Conference | 84 |
ISSN | Citations | PageRank |
0925-7721 | 1 | 0.34 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| steven chaplick | 1 | 76 | 16.91 |
| Fabian Lipp | 2 | 14 | 4.44 |
| Alexander Wolff | 3 | 5 | 1.53 |
| Johannes Zink | 4 | 1 | 1.35 |