On a Visibility Representation of Graphs

  title={On a Visibility Representation of Graphs},
  author={Francisco Javier Cobos and Juan Carlos Dana and Ferran Hurtado and A. M{\'a}rquez and F. Mateos},
  booktitle={Graph Drawing},
We give a visibility representation of graphs which extends some very well-known representations considered extensively in the literature. Concretely, the vertices are represented by a collection of parallel hyper-rectangles in Rn and the visibility is orthogonal to those hyper-rectangles. With this generalization, we can prove that each graph admits a visibility representation. But, it arises the problem of determining the minimum Euclidean space where such representation is possible. We… 
A Visibility Representation for Graphs in Three Dimensions
An extension of the Erd} os-Szekeres Theorem in a geometric setting is applied to obtain an upper bound of n = 56 for the largest representable complete graph Kn, and it is shown by construction that n 22 are the best existing bounds.
3D Visibility Representations of 1-planar Graphs
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,
Thickness of Bar 1-Visibility Graphs
For a special case of bar 1-visibility graphs, an algorithm partitioning the edges into two plane graphs is presented, showing that for this class the thickness is indeed bounded by 2.
Unit Hypercube Visibility Numbers of Trees
A visibility representation of a graph G is an assignment of the vertices of G to geometric objects such that vertices are adjacent if and only if their corresponding objects are “visible” each
Bar 1-visibility representation of optimal 1-planar graph
In a visibility representation of a graph, the vertices map to objects in Euclidean space and the edges are determined by certain visibility relations. A bar visibility representation of a planar
Parameters of Bar k-Visibility Graphs
An algorithm partitioning the edges of a semi bar 1-visibility graph into two plane graphs is presented, showing that for this subclass the (geometric) thickness is indeed bounded by 2.
On Aligned Bar 1-Visibility Graphs
A new operation, called path-addition, is introduced that admits the addition of vertex-disjoint paths to a given graph and it is shown that AB1V graphs are closed under path- addition.
Rectangle and Box Visibility Graphs in 3D
Lower and upper bounds for the size of the largest complete graph that can be represented in rectangle and box visibility representations of graphs in 3-dimensional space are examined.


A unified approach to visibility representations of planar graphs
This work studies visibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments that intersect only adjacent vertex-segments, and considers three types of visibility representations.
Universal 3-Dimensional Visibility Representations for Graphs
New Results on a Visibility Representation of Graphs in 3D
This paper considers a 3-dimensional visibility representation of cliques in which vertices are represented by unit discs and by discs of arbitrary radii (possibly different for different vertices); they are also represented by axis-aligned unit squares, by axes-aligned squares of arbitrary size, and byaxis-aligned rectangles.
Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs
Grid intersection graphs and boxicity
Characterizing bar line-of-sight graphs
A restricted version of the problem (using line segments and a single line-of-sight) is discussed and the associated graphs are characterized.
Floorplans, planar graphs and layouts
The existence and uniqueness of a zero wasted area layout are proved and characterized by a necessary and sufficient condition, and an efficient procedure to derive a rectilinear representation for any planar graph is presented.
An application of graph coloring to printed circuit testing
Under certain assumptions on the possible types of short circuits, the structure of line-of-sight graphs is analyzed and it is shown that a well-known and efficient algorithm can be used to color them with a small number of colors.
VLSI Algorithms and Architectures
This paper analyzes four viable architectures — the shuffle-exchange, the linear array, the mesh, and the cube-connected-cycles — which emulate the binary cube.
On Unimodal Subsequences
  • F. Graham
  • Mathematics
    J. Comb. Theory, Ser. A
  • 1980