Triangle-Free Planar Graphs as Segments Intersection Graphs

De Castro, Natalia and Cobos, F. J. and Dana, J. C. and Márquez, Alberto and Noy, M. (1999) Triangle-Free Planar Graphs as Segments Intersection Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 341-350(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_35).

Full text not available from this repository.

Abstract

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 way that no two segments cross, i. e., intersect in a common interior point.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-46648-7_35
Classifications: Z Theory > Z.999 Others
Z Theory > Z.250 Geometry
M Methods > M.600 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/377

Actions (login required)

View Item View Item