Witness rectangle graphs
Tipus de documentArticle
Condicions d'accésAccés restringit per política de l'editorial
In a witness rectangle graph (WRG) on vertex point set P with respect to witness point set W in the plane, two points x, y in P are adjacent whenever the open isothetic rectangle with x and y as opposite corners contains at least one point in W. WRGs are representative of a larger family of witness proximity graphs introduced in two previous papers. We study graph-theoretic properties of WRGs. We prove that any WRG has at most two non-trivial connected components. We bound the diameter of the non-trivial connected components of a WRG in both the one-component and two-component cases. In the latter case, we prove that a graph is representable as a WRG if and only if each component is a connected co-interval graph, thereby providing a complete characterization of WRGs of this type. We also completely characterize trees drawable as WRGs. In addition, we prove that a WRG with no isolated vertices has domination number at most four. Moreover, we show that any combinatorial graph can be drawn as a WRG using a combination of positive and negative witnesses. Finally, we conclude with some related results on the number of points required to stab all the rectangles defined by a set of n points.
CitacióAronov, B.; Dulieu, M.; Hurtado, F. Witness rectangle graphs. "Graphs and combinatorics", Juliol 2014, vol. 30, núm. 4, p. 827-846.
Versió de l'editorhttp://link.springer.com/article/10.1007%2Fs00373-013-1316-x
|Aronov et al.pdf||499.8Kb||Accés restringit|