Buscar
Mostrando ítems 1-3 de 3
Artículo
Triangle-Free Planar Graphs as Segments Intersection Graphs
(1999)
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and oblique) and in such a ...
Artículo
Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard
(1997)
This paper is devoted to the study of graph embeddings in the grid of non-planar surfaces. We provide an adequate model for those embeddings and we study the complexity of minimizing the number of bends. In particular, we ...
Artículo
Cover Contact Graphs
(2007)
We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) by a set of other geometric objects (a so-called cover, e.g., a set of disks or homothetic triangles). ...