pith. sign in

arxiv: 1708.06196 · v1 · pith:DPI3DNK2new · submitted 2017-08-21 · 💻 cs.CG

3D Visibility Representations of 1-planar Graphs

classification 💻 cs.CG
keywords representationvisibilityrectanglesplanarz-paralleladditionconstructeddefines
0
0 comments X
read the original abstract

We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed z-parallel visibilities between pairs of rectangles. In addition, the constructed representation is such that there is a plane that intersects all the rectangles, and this intersection defines a bar 1-visibility representation of G.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.